Message-optimal connected dominating sets in mobile ad hoc networks

A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS has been proposed as a virtual backbone for routing in wireless ad hoc networks. However, it is NP-hard to find a minimum connected dominating set (MCDS). Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a very poor approximation ratio, and from high time complexity and message complexity. Recently, new distributed heuristics for constructing a CDS were developed, with constant approximation ratio of 8. These new heuristics are based on a construction of a spanning tree, which makes it very costly in terms of communication overhead to maintain the CDS in the case of mobility and topology changes. In this paper, we propose the first distributed approximation algorithm to construct a MCDS for the unit-disk-graph with a constant approximation ratio, and l...

• Type: Conference
• Year: 2002
• Where: MOBIHOC
• Authors: Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
• Keywords: Approximation Algorithms, Connected Dominating, Constant Approximation Ratio, MOBIHOC 2002, Wireless Networks