Leveraging 1-hop Neighborhood Knowledge for Connected Dominating Set in Wireless Sensor Networks

To improve the efficiency of routing and broadcast and reducing energy consumption in the process of data transmission, calculating minimum connected dominating set is always used to construct virtual backbone network in wireless sensor networks. Calculating the minimum connected dominating set (MCDS)  of plane graphs is a NP-complete problem. In this paper, an algorithm leveraging 1-hop neighborhood knowledge for connected dominating set  is proposed. First, the minimum forwarding set is calculated severally by each node in the entire network. Then any one node can start the process of broadcasting messages including the information of minimum forwarding set in the network. Finally, the connected dominating set of the entire network is achieved by exchanging information. The proposed algorithm aims to get  a small connected dominating set, meanwhile, to minimize the consumption of energy and time. The simulation results  show that the algorithm has achieved its purpose with fast convergence, low transmission traffic and reasonable size of connected dominating set.

[1]  Weili Wu,et al.  Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks , 2006, J. Glob. Optim..

[2]  Bernard Mans,et al.  Energy-Efficient Virtual Backbones for Reception-Aware MANET , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

[3]  Weili Wu,et al.  A greedy approximation for minimum connected dominating sets , 2004, Theor. Comput. Sci..

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

[5]  Majid Sarrafzadeh,et al.  Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks , 2008, DISC.

[6]  Panos M. Pardalos,et al.  A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks , 2004 .

[7]  Lu,et al.  Approximation Algorithms for the Connected Dominating Set Problem in Unit Disk Graphs , 2009 .

[8]  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.

[9]  Hongwei Du,et al.  PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks , 2010, COCOA.

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

[11]  Jie Wu,et al.  Performance analysis of broadcast protocols in ad hoc networks based on self-pruning , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[12]  Jie Wu,et al.  Extended multipoint relays to determine connected dominating sets in MANETs , 2006, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[13]  Joseph P. Macker,et al.  Distributed connected dominating set election from uniform random to power law network graphs , 2009, MILCOM 2009 - 2009 IEEE Military Communications Conference.

[14]  Xiaohua Jia,et al.  Interference-Aware, Fully-Distributed Virtual Backbone Construction and its Application in Multi-Hop Wireless Networks , 2010, IEEE Transactions on Communications.

[15]  Wenyong Wang,et al.  One-Hop Neighbor Transmission Coverage Information Based Distributed Algorithm for Connected Dominating Set , 2010, 2010 3rd International Symposium on Parallel Architectures, Algorithms and Programming.