Sciweavers

105 search results - page 1 / 21
» Hierarchical routing in ad hoc networks using k-dominating s...
Sort
View
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 4 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
IPPS
2005
IEEE
14 years 4 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
SIGMOBILE
2008
33views more  SIGMOBILE 2008»
13 years 10 months ago
Hierarchical routing in ad hoc networks using k-dominating sets
Michael Q. Rieck, Subhankar Dhar
PDPTA
2004
14 years 4 days ago
A New Adaptive Distributed Routing Protocol Using d-hop Dominating Sets for Mobile Ad Hoc Networks
In this paper, we propose an adaptive self- stabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with commun...
Zhengnan Shi, Pradip K. Srimani
ADHOC
2008
88views more  ADHOC 2008»
13 years 11 months ago
Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking
As wireless devices become more pervasive, mobile ad hoc networks are gaining importance, motivating the development of highly scalable ad hoc networking techniques. In this paper...
Shu Du, Ahamed Khan, Santashil PalChaudhuri, Ansle...