Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey

Topology control is a fundamental issue in wireless ad hoc and sensor networks. Due to intrinsic characteristic of flatness, hierarchical topology can achieve the scalability and efficiency of a wireless network. To solve this problem, one can construct a virtual backbone network by using a connected dominating (CDS) set of a wireless network. In past few years, efficiently and fast construct a CDS in a wireless network as a virtual backbone has been the main research problem in hierarchical topology control. In this paper, we give a comprehensive survey for CDSs and related problems with various network models and specific applications. To conclude, some open problems and interesting issues in this field are proposed.

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

[2]  Rajiv Gandhi,et al.  Distributed algorithms for connected domination in wireless networks , 2007, J. Parallel Distributed Comput..

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

[4]  Jiguo Yu,et al.  Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks , 2010, WASA.

[5]  Wei Shi,et al.  An effective connected dominating set based mobility management algorithm in MANETs , 2008 .

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

[7]  Yingshu Li,et al.  k-Strongly Connected m-Dominating and Absorbing Set in Wireless Ad Hoc Networks with Unidirectional Links , 2007, International Conference on Wireless Algorithms, Systems and Applications (WASA 2007).

[8]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[9]  Chong-kwon Kim,et al.  Multicast tree construction and flooding in wireless ad hoc networks , 2000, MSWIM '00.

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

[11]  Jie Wu,et al.  Efficient Directional Network Backbone Construction in Mobile Ad Hoc Networks , 2008, IEEE Transactions on Parallel and Distributed Systems.

[12]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[13]  Miguel A. Labrador,et al.  Atarraya: a simulation tool to teach and research topology control algorithms for wireless sensor networks , 2009, SimuTools.

[14]  Xiaohua Jia,et al.  Energy efficient distributed connected dominating sets construction in wireless sensor networks , 2006, IWCMC '06.

[15]  Miguel A. Labrador,et al.  A family of simple distributed minimum connected dominating set-based topology construction algorithms , 2011, J. Netw. Comput. Appl..

[16]  Xiuzhen Cheng,et al.  An Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks , 2004 .

[17]  Shekhar Verma,et al.  A Power Aware Minimum Connected Dominating Set for Wireless Sensor Networks , 2009, J. Networks.

[18]  Ignacio E. Grossmann,et al.  Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks , 2011, Optim. Lett..

[19]  Ching-Chi Hsu,et al.  Routing in wireless/mobile ad‐hoc networks via dynamic group construction , 2000, Mob. Networks Appl..

[20]  Budhaditya Deb,et al.  Multi-resolution state retrieval in sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[21]  Zhu Qi,et al.  Cooperative spectrum sensing method based on energy consumption , 2012 .

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

[23]  Kazuya Sakai,et al.  Maintaining CDS in Mobile Ad Hoc Networks , 2008, WASA.

[24]  Donghyun Kim,et al.  Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network , 2008, WASA.

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

[26]  Imran A. Pirwani,et al.  Energy conservation via domatic partitions , 2006, MobiHoc '06.

[27]  Anis Laouiti,et al.  Multipoint relaying for flooding broadcast messages in mobile wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[28]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[29]  David W. Matula,et al.  Building (1 - epsilon) Dominating Sets Partition as Backbones in Wireless Sensor Networks Using Distributed Graph Coloring , 2010, DCOSS.

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

[31]  Математика.  Maximal Independent Set , 2010 .

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

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

[34]  Chittaranjan A. Mandal,et al.  Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks , 2009, IEEE Transactions on Mobile Computing.

[35]  J. H. Park,et al.  Visualisation of efficiency coverage and energy consumption of sensors in wireless sensor networks using heat map , 2011, IET Commun..

[36]  Sung-Ju Lee,et al.  Mobility prediction and routing in ad hoc wireless networks , 2001, Int. J. Netw. Manag..

[37]  Weili Wu,et al.  A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks , 2009, J. Glob. Optim..

[38]  Roger Wattenhofer,et al.  Constant-time distributed dominating set approximation , 2003, PODC '03.

[39]  Zygmunt J. Haas,et al.  Virtual backbone generation and maintenance in ad hoc network mobility management , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[40]  Xiang-Yang Li,et al.  Interference-aware topology control for wireless sensor networks , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

[41]  Arthur L. Liestman,et al.  Maintaining weakly-connected dominating sets for clustering ad hoc networks , 2005, Ad Hoc Networks.

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

[43]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[44]  Ding-Zhu Du,et al.  On greedy construction of connected dominating sets in wireless networks , 2005, Wirel. Commun. Mob. Comput..

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

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

[47]  Jiguo Yu,et al.  Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks , 2012, J. Parallel Distributed Comput..

[48]  Choong Seon Hong,et al.  Weakly connected dominating set-based secure clustering and operation in distributed sensor networks , 2009 .

[49]  Christoph Lenzen,et al.  Minimum Dominating Set Approximation in Graphs of Bounded Arboricity , 2010, DISC.

[50]  Donghyun Kim,et al.  A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs , 2010, IEEE Transactions on Mobile Computing.

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

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

[53]  Arthur L. Liestman,et al.  Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks , 2002, MobiHoc '02.

[54]  Pascal Bouvry,et al.  On quantifying the quality of CDS-based virtual backbones in mobile ad hoc networks , 2010, MobiWac '10.

[55]  OPHIR FRIEDER,et al.  Maximal Independent Set, Weakly-Connected Dominating Set, and Induced Spanners in Wireless Ad Hoc Networks , 2003, Int. J. Found. Comput. Sci..

[56]  Ding-Zhu Du,et al.  Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links , 2006, APWeb.

[57]  David W. Matula,et al.  Building ( 1 − ) Dominating Sets Partition as Backbones in Wireless Sensor Networks Using Distributed Graph Coloring , .

[58]  Haroon Malik,et al.  A comparative study on simulation vs. real time deployment in wireless sensor networks , 2011, J. Syst. Softw..

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

[60]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

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

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

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

[64]  L. Gewali,et al.  Generating quality dominating sets for sensor network , 2005, Sixth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'05).

[65]  Min Chen,et al.  NetTopo: A framework of simulation and visualization for wireless sensor networks , 2011, Ad Hoc Networks.

[66]  Yang Hong-zhang,et al.  Directed Diffusion Routing Protocol Based on Network Coding , 2010 .

[67]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[68]  Michael Q. Rieck,et al.  Distributed Routing Algorithms for Wireless Ad Hoc Networks using d-Hop Connected d-hop Dominating Sets , 2002 .

[69]  Selim G. Akl,et al.  A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks , 2008, 2008 14th IEEE International Conference on Parallel and Distributed Systems.

[70]  Jie Wu,et al.  Iterative local solutions for connected dominating set in ad hoc wireless networks , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[71]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[72]  Miguel A. Labrador,et al.  Topology Control in Wireless Sensor Networks: with a companion simulation tool for teaching and research , 2009 .

[73]  Ding-Zhu Du,et al.  Connected Domination in Multihop Ad Hoc Wireless Networks , 2002, JCIS.

[74]  Jie Wu,et al.  A transmission range reduction scheme for power-aware broadcasting in ad hoc networks using connected dominating sets , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[75]  Yu Wang,et al.  Efficient Fault Tolerant Topology Control for Three-Dimensional Wireless Networks , 2008, 2008 Proceedings of 17th International Conference on Computer Communications and Networks.

[76]  D. Matula,et al.  Employing (1 − ε) dominating set partitions as backbones in wireless sensor networks , 2010 .

[77]  Michael R. Fellows,et al.  Parameterized approximation of dominating set problems , 2008, Inf. Process. Lett..

[78]  Jie Wu,et al.  Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links , 2002, IEEE Trans. Parallel Distributed Syst..

[79]  Natarajan Meghanathan,et al.  An Algorithm to Determine Energy-aware Connected Dominating Set and Data Gathering Tree for Wireless Sensor Networks , 2009, International Conference on Wireless Networks.

[80]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[82]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

[83]  Jorge Urrutia,et al.  Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes , 2008, LATIN.

[84]  Jie Wu,et al.  Broadcasting in Ad Hoc Networks Based on Self-Pruning , 2003, Int. J. Found. Comput. Sci..

[85]  Michael Q. Rieck,et al.  Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets , 2005, Comput. Networks.

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

[87]  Stefan Schmid,et al.  Algorithmic models for sensor networks , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[88]  Deying Li,et al.  Minimum Connected R-Hop k-Dominating Set in Wireless Networks , 2009, Discret. Math. Algorithms Appl..

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

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

[91]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[92]  Wei Wang,et al.  A PTAS for minimum d-hop connected dominating set in growth-bounded graphs , 2010, Optim. Lett..

[93]  QI Ying-ying.  Nodes Neighborhood Relation-based Construction Algorithm for Minimum Connected Domination Set , 2010 .

[94]  Sergiy Butenko,et al.  On connected domination in unit ball graphs , 2011, Optim. Lett..

[95]  Miguel A. Labrador,et al.  A3: A Topology Construction Algorithm for Wireless Sensor Networks , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[96]  Xiuzhen Cheng,et al.  Aggregation tree construction in sensor networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[97]  Christian Scheideler,et al.  An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model , 2008, MobiHoc '08.

[98]  Henk Meijer,et al.  A Constant Factor Distributed Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks , 2022 .

[99]  Al-Sakib Khan Pathan,et al.  ViSim: A user-friendly graphical simulation tool for performance analysis of MANET routing protocols , 2011, Math. Comput. Model..

[100]  Jie Wu,et al.  Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication , 2006, IEEE Transactions on Parallel and Distributed Systems.

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

[102]  Weijia Jia,et al.  Clustering wireless ad hoc networks with weakly connected dominating set , 2007, J. Parallel Distributed Comput..

[103]  Jie Wu,et al.  Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets , 2003, Wirel. Commun. Mob. Comput..

[104]  Ivan Stojmenovic,et al.  Broadcasting and Activity Scheduling in AD HOC Networks , 2004 .

[105]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[106]  P. S. Hiremath,et al.  Concepts of Graph Theory Relevant to Ad-hoc Networks , 2008 .

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