40 search results - page 6 / 8 » Efficient Construction of Weakly-Connected Dominating Set fo... |
ICDCS
2006
IEEE
14 years 9 days 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...
IPPS
2002
IEEE
13 years 11 months ago
2002
IEEE
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
COMCOM
2007
13 years 6 months ago
2007
—In Ad Hoc networking, cluster-based communication protocol can reduce large amount of flooding packets in route establishment process. However, the 802.11 medium access control ...
ICCS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We propose a distributed and adaptive topology management algorithm, called PATM (Priority-based Adaptive Topology Management), that constructs and maintains a connected ...
AINA
2008
IEEE
14 years 23 days ago
2008
IEEE
—In a broadcasting task, source node wants to send the same message to all the other nodes in the network. Existing solutions range from connected dominating set (CDS) based for ...