460 search results - page 61 / 92 » Bounding the locality of distributed routing algorithms |
125
click to vote
TWC
2008
14 years 11 months ago
2008
This paper considers a multi-hop network in which relay nodes cooperate to minimize the total energy consumed in transmitting a (unicast) packet from a source to a destination. We...
CCR
2006
14 years 12 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
102
click to vote
SIROCCO
2007
15 years 1 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
106
click to vote
DIALM
2003
ACM
15 years 5 months ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
110
click to vote
MONET
2007
14 years 11 months ago
2007
— This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level conc...