12 search results - page 2 / 3 » Approximating minimum size weakly-connected dominating sets ... |
INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
BROADNETS
2005
IEEE
13 years 10 months ago
2005
IEEE
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
ICC
2009
IEEE
13 years 2 months ago
2009
IEEE
In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by...
ICDCS
2006
IEEE
13 years 10 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
INFOCOM
2000
IEEE
13 years 9 months 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...