A layer-based algorithm for the construction of connected dominating set in WSNs

A small-sized virtual backbone is desirable to optimise the performance of wireless sensor networks. It is equivalent mathematically to the connected dominating set CDS in a graph. In this paper, we propose a layer-based algorithm for the construction of connected dominating set LCDS. The algorithm divides the network into multiple layers according to the hop counts from a selected source node. Within each layer a local dominating set is constructed by greedy method in distributed manner to cover all the nodes in the next layer and the union of the dominating sets from all layers composes the CDS of the entire network. The experimental results show that LCDS algorithm generates a smaller CDS with less communication overhead even in high node density scenarios and its size varies relatively little with the rapid increase in node density.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Dong Zhou,et al.  A timer-based protocol for connected dominating set construction in IEEE 802.11 multihop mobile ad hoc networks , 2005, The 2005 Symposium on Applications and the Internet.

[3]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Kazuya Sakai,et al.  Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks , 2009, 2009 IEEE International Conference on Communications.

[5]  Kais Mnif,et al.  Virtual backbone based on MCDS for topology control in wireless ad hoc networks , 2005, PE-WASUN '05.

[6]  Symeon Papavassiliou,et al.  A mobility‐based clustering approach to support mobility management and multicast routing in mobile ad‐hoc wireless networks , 2001, Int. J. Netw. Manag..

[7]  Pedro M. Wightman,et al.  An optimal solution to the MCDS problem for topology construction in wireless sensor networks , 2010, 2010 IEEE Latin-American Conference on Communications.

[8]  Zhou Ming-tian.  Maximal Independent Set Based Distributed Algorithm for Minimum Connected Dominating Set , 2007 .

[9]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

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

[11]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[12]  Yong Tang,et al.  A Distributed Algorithm for Virtual Backbone Construction with Cellular Structure in WSNs , 2012, Int. J. Distributed Sens. Networks.

[13]  Wenyong Wang,et al.  Leveraging 1-hop Neighborhood Knowledge for Connected Dominating Set in Wireless Sensor Networks , 2012, J. Comput..

[14]  Mimoza Durresi,et al.  Routing through Backbone Structures in Sensor Networks , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[15]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[16]  Kazuya Sakai,et al.  Multi-Initiator Connected Dominating Set Construction for Mobile Ad Hoc Networks , 2008, 2008 IEEE International Conference on Communications.