Sciweavers

1684 search results - page 18 / 337
» Connectivity in cooperative wireless ad hoc networks
Sort
View
JNW
2007
104views more  JNW 2007»
14 years 9 months ago
A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks
— 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...
Rashid Bin Muhammad
DCOSS
2011
Springer
13 years 9 months ago
Construction of connected dominating sets in large-scale MANETs exploiting self-stabilization
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
Stefan Unterschutz, Volker Turau
GLOBECOM
2007
IEEE
15 years 4 months ago
On the Design of Future Wireless Ad Hoc Networks
— In this paper, we study the design of future wireless ad hoc networks. Particularly, we consider that the future wireless ad hoc networks shall be able to efficiently provide ...
Kejie Lu, Shengli Fu, Tao Zhang, Yi Qian
INFOCOM
2003
IEEE
15 years 3 months ago
Cooperative Packet Caching and Shortest Multipath Routing in Mobile Ad hoc Networks
- A mobile ad hoc network is an autonomous system of infrastructureless, multihop wireless mobile nodes. Reactive routing protocols perform well in such an environment due to their...
Alvin C. Valera, Winston Khoon Guan Seah, S. V. Ra...
JPDC
2007
112views more  JPDC 2007»
14 years 9 months ago
Distributed algorithms for connected domination in wireless networks
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
Rajiv Gandhi, Srinivasan Parthasarathy 0002