969 search results - page 37 / 194 » Distributed Clustering for Ad Hoc Networks |
221
click to vote
MOBICOM
2003
ACM
16 years 17 days ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
211
Voted
JNW
2007
15 years 7 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
218
Voted
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Ultra wide band (UWB) ad-hoc networks have attracted much research attention in recent years. This paper proposes and investigates a new distributed cooperative routing strateg...
181
click to vote
DCOSS
2005
Springer
16 years 26 days ago
2005
Springer
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...