105 search results - page 1 / 21 » Hierarchical routing in ad hoc networks using k-dominating s... |
IWDC
2005
Springer
13 years 10 months ago
2005
Springer
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...
IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
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...
SIGMOBILE
2008
13 years 4 months ago
2008
PDPTA
2004
13 years 6 months ago
2004
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...
ADHOC
2008
13 years 4 months ago
2008
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...