1008 search results - page 151 / 202 » Routing in intermittent network topologies |
169
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
181
click to vote
ADHOC
2006
15 years 6 months ago
2006
In wireless ad hoc sensor networks, energy use is in many cases the most important constraint since it corresponds directly to operational lifetime. Topology management schemes su...
151
click to vote
TSP
2008
15 years 6 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
166
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
213
click to vote
ENTCS
2007
15 years 6 months ago
2007
Designing secure protocols over ad-hoc networks has proved to be a very challenging task, due to various features of such networks, such as partial connectivity, node mobility, an...