522 search results - page 16 / 105 » Connected k-Hop Clustering in Ad Hoc Networks |
ESA
2003
Springer
14 years 26 days ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
DSN
2002
IEEE
14 years 19 days ago
2002
IEEE
We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a ddimensional re...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
— The connected dominating set (CDS) has been extensively used for routing and broadcast in mobile ad hoc networks. While existing CDS protocols are successful in constructing CD...
TELSYS
2008
13 years 7 months ago
2008
This paper investigates connectivity in one-dimensional ad hoc networks by means of the distribution of the minimum hop count between source and destination nodes. We derive the ex...
ISCC
2009
IEEE
14 years 2 months ago
2009
IEEE
— A well-known approach to increase the resilience of mobile ad hoc networks (MANETs) and unstructured sensor networks is to ensure a network topology where there are at least k ...