A distributed connected dominating set using adjustable sensing range

A Connected Dominating Set (CDS) serving as a virtual backbone, is an effective way to optimize the network's topology and minimize communication overheads in network. A minimum connected dominating set (MCDS) offers an optimized way of routing messages in wireless networks. In this paper the target coverage is achieved with adjustable sensing range in the proposed distributed CDS based on prime node-ID (CDS-PN) modelled in unit disk graph (UDG) [1]. CDS-PN has time complexity of O(n2) and message complexity of O(n), where n is the number of nodes. Theoretical performance analysis is presented to verify efficiency of our approach.

[1]  Madjid Merabti,et al.  Monitoring connectivity in wireless sensor networks , 2009, 2009 IEEE Symposium on Computers and Communications.

[2]  Xiuzhen Cheng,et al.  Connected Dominating Set in Sensor Networks and MANETs , 2004 .

[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]  Jie Wu,et al.  Maximum network lifetime in wireless sensor networks with adjustable sensing ranges , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[5]  Hao Wang,et al.  A coverage hole detection method and improvement scheme in WSNs , 2011, 2011 International Conference on Electric Information and Control Engineering.

[6]  Jie Wu,et al.  Energy-Efficient Connected Coverage of Discrete Targets in Wireless Sensor Networks , 2005, ICCNMC.

[7]  M. P. Sebastian,et al.  A connected dominating set-based weighted clustering algorithm for wireless sensor networks , 2010, 2010 IEEE International Conference on Wireless Communications, Networking and Information Security.

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

[9]  A. Naebi,et al.  Artificial Bee Colony algorithm construction minimum connected dominating set in wireless networks , 2012, 2012 International Conference on Computer and Communication Engineering (ICCCE).

[10]  Shigeng Zhang,et al.  A data gathering algorithm based on energy-balanced connected dominating sets in wireless sensor networks , 2013, 2013 IEEE Wireless Communications and Networking Conference (WCNC).

[11]  Li Xu,et al.  Constructing Connected Dominating Set Based on Crossed Cube in WSN , 2013, 2013 5th International Conference on Intelligent Networking and Collaborative Systems.

[12]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

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