Constructing Distributed Connected Dominating Sets in Growth-Bounded Graphs

When modeling the network as a graph, the most widely used concept for defining a virtual backbone is the connected dominating set (CDS). We present a distributed algorithm for finding an approximation of a Minimum connected dominating sets to construct a virtual backbone in the growth- bounded graph. This approach consists of three phases: firstly construct an MIS by network decomposition; secondly find a minimum dominating set and finally use Marking process and ruling K to optimize the virtual backbone. The algorithms run with adjustable transmission range and computer a (1+epsiv)- approximation MCDS. The time complexity is O(TMIS+log*n/epsivO(1)), where TMIS is the time required to compute a maximal independent set in the graph and n denotes the number of nodes. The only information required by the nodes is the set of their direct neighbors. Our algorithm guarantees that the computed CDS has constant stretch and constant degree.

[1]  Weili Wu,et al.  Minimum connected dominating sets and maximal independent sets in unit disk graphs , 2006, Theor. Comput. Sci..

[2]  Xiaohua Jia,et al.  Virtual backbone construction in multihop ad hoc wireless networks , 2006, Wirel. Commun. Mob. Comput..

[3]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2004, Mob. Networks Appl..

[4]  Donghyun Kim,et al.  Constructing Connected Dominating Sets with Bounded Diameters inWireless Networks , 2007, International Conference on Wireless Algorithms, Systems and Applications (WASA 2007).

[5]  Johann Hurink,et al.  A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs , 2005, WAOA.

[6]  Alessandro Panconesi,et al.  Localized protocols for ad hoc clustering and backbone formation: a performance comparison , 2006, IEEE Transactions on Parallel and Distributed Systems.

[7]  Beat Gfeller,et al.  A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs , 2007, PODC '07.

[8]  Roger Wattenhofer,et al.  Local approximation schemes for ad hoc and sensor networks , 2005, DIALM-POMC '05.

[9]  Junmo Yang,et al.  Energy-aware connected dominating set construction in mobile ad hoc networks , 2005, Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005..

[10]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[11]  PanconesiAlessandro,et al.  Localized Protocols for Ad Hoc Clustering and Backbone Formation , 2006 .

[12]  Ding-Zhu Du,et al.  Localized Construction of Connected Dominating Set in Wireless Networks , 2004 .

[13]  Roger Wattenhofer,et al.  Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs , 2005, DISC.

[14]  Beat Gfeller,et al.  A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs , 2007, Ad Hoc Sens. Wirel. Networks.

[15]  Yingshu Li,et al.  Constructing k-Connected m-Dominating Sets in Wireless Sensor Networks , 2007, MILCOM 2007 - IEEE Military Communications Conference.