90 search results - page 6 / 18 » On the minimum hop count and connectivity in one-dimensional... |
INFOCOM
2000
IEEE
14 years 29 days ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
ADHOCNOW
2006
Springer
14 years 2 months ago
2006
Springer
In this paper, we outline a simple approach, called ROAR, that enables the Ad-Hoc On-Demand Distance Vector (AODV) routing protocol to strengthen its routes by recruiting neighbors...
ICDCS
2008
IEEE
14 years 3 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
ICWN
2010
13 years 6 months ago
2010
Wireless and ad hoc networks often have local regions of highly intra-connected modules or communities of nodes against a backdrop of sparser longer-range intercommunity connectiv...
ICDCS
2002
IEEE
14 years 1 months ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...