An efficient connected dominating set algorithm in WSNs based on the induced tree of the crossed cube

Abstract The connected dominating set (CDS) has become a well-known approach for constructing a virtual backbone in wireless sensor networks. Then traffic can forwarded by the virtual backbone and other nodes turn off their radios to save energy. Furthermore, a smaller CDS incurs fewer interference problems. However, constructing a minimum CDS is an NP-hard problem, and thus most researchers concentrate on how to derive approximate algorithms. In this paper, a novel algorithm based on the induced tree of the crossed cube (ITCC) is presented. The ITCC is to find a maximal independent set (MIS), which is based on building an induced tree of the crossed cube network, and then to connect the MIS nodes to form a CDS. The priority of an induced tree is determined according to a new parameter, the degree of the node in the square of a graph. This paper presents the proof that the ITCC generates a CDS with a lower approximation ratio. Furthermore, it is proved that the cardinality of the induced trees is a Fibonacci sequence, and an upper bound to the number of the dominating set is established. The simulations show that the algorithm provides the smallest CDS size compared with some other traditional algorithms.

[1]  Donghyun Kim,et al.  A New Constant Factor Approximation for Computing 3-Connected m-Dominating Sets in Homogeneous Wireless Networks , 2010, 2010 Proceedings IEEE INFOCOM.

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

[3]  Dajin Wang,et al.  A Coloring Based Backbone Construction Algorithm in Wireless Ad Hoc Network , 2006, GPC.

[4]  F. Frances Yao,et al.  Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks , 2008, 2008 The 28th International Conference on Distributed Computing Systems.

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

[6]  Weili Wu,et al.  Analysis on Theoretical Bounds for Approximating Dominating Set Problems , 2009, Discret. Math. Algorithms Appl..

[7]  Yingshu Li,et al.  Construction algorithms for k-connected m-dominating sets in wireless sensor networks , 2008, MobiHoc '08.

[8]  Ning Zhang,et al.  On approximation algorithms of k-connected m-dominating sets in disk graphs , 2007, Theor. Comput. Sci..

[9]  Weili Wu,et al.  Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[10]  Donghyun Kim,et al.  Minimum Total Communication Power Connected Dominating Set in Wireless Networks , 2012, WASA.

[11]  Jie Wu,et al.  On constructing k-connected k-dominating set in wireless networks , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[12]  Deying Li,et al.  Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.

[13]  Ding-Zhu Du,et al.  On the construction of 2-connected virtual backbone in wireless networks , 2009, IEEE Transactions on Wireless Communications.

[14]  Minming Li,et al.  Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs , 2011, Algorithmica.

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

[16]  Weili Wu,et al.  New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs , 2011, Theor. Comput. Sci..

[17]  Guo-lin,et al.  An Equivalent Definition of the Crossed Cube , 2011 .

[18]  Michael Segal,et al.  A simple improved distributed algorithm for minimum CDS in unit disk graphs , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[19]  Raheem A. Beyah,et al.  On the construction of k-connected m-dominating sets in wireless networks , 2012, J. Comb. Optim..

[20]  Lin Zhi-wei.  Graph coloring based minimal connected dominating set algorithm in wireless ad hoc networks , 2007 .

[21]  Bo Han,et al.  Zone-based virtual backbone formation in wireless ad hoc networks , 2009, Ad Hoc Networks.

[22]  Chittaranjan A. Mandal,et al.  Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks , 2010, IEEE Transactions on Parallel and Distributed Systems.

[23]  Panos M. Pardalos,et al.  Wireless networking, dominating and packing , 2010, Optim. Lett..

[24]  Deying Li,et al.  A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.

[25]  Yi Pan,et al.  Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks , 2013, Theor. Comput. Sci..

[26]  Weili Wu,et al.  Efficient Virtual Backbone Construction with Routing Cost Constraint in Wireless Networks Using Directional Antennas , 2012, IEEE Transactions on Mobile Computing.

[27]  Abdulaziz Zam,et al.  Performance Improvement of Cache Management In Cluster Based MANET , 2013 .

[28]  Zhao Zhang,et al.  A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph , 2013 .

[29]  Jovan Dj. Golic.  A new authentication model for ad hoc networks , 2012, International Journal of Information Security.

[30]  Robert H. Deng,et al.  Secure localization with attack detection in wireless sensor networks , 2011, International Journal of Information Security.

[31]  Zhen Li,et al.  Portfolio optimization of computer and mobile botnets , 2013, International Journal of Information Security.

[32]  Donghyun Kim,et al.  Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[33]  Hossam Mahmoud Ahmad Fahmy,et al.  RCA: Efficient connected dominated clustering algorithm for mobile ad hoc networks , 2014, Comput. Networks.

[34]  Xiaohua Jia,et al.  Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes , 2013, J. Parallel Distributed Comput..

[35]  Jie Wu,et al.  On Maximizing the Lifetime of Wireless Sensor Networks Using Virtual Backbone Scheduling , 2012, IEEE Transactions on Parallel and Distributed Systems.

[36]  T. V. Padmavathy,et al.  Performance Evaluation of Energy Efficient Modulation Scheme and Hop Distance Estimation for WSN , 2010, Int. J. Commun. Networks Inf. Secur..

[37]  Yuansheng Luo,et al.  An energy efficient MCDS construction algorithm for wireless sensor networks , 2012, EURASIP Journal on Wireless Communications and Networking.