Connected Dominating Set in Wireless Networks

In a graph G D .V;E/, a subset C of vertices is called a Connected Dominating Set if every vertex is either in C or adjacent to a vertex in C , and in addition the subgraph induced by C is connected. Given a graph, finding the minimum Connected Dominating Set is a classical combinatorial optimization problem, existing in literature for a long time. Due to wide applications of the minimum Connected Dominating Set in wireless networks, Connected Dominating Sets attract many recent research efforts. In this chapter, those developments are surveyed.

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

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

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

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

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

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

[7]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

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

[9]  Lusheng Wang,et al.  Approximations for Steiner Trees with Minimum Number of Steiner Points , 2000, J. Glob. Optim..

[10]  Peng-Jun Wan,et al.  Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

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

[12]  Ning Hu,et al.  Connected Dominating Set in 3-dimensional Space for Ad Hoc Network , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[13]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[14]  Panos M. Pardalos,et al.  Analysis of greedy approximations with nonsubmodular potential functions , 2008, SODA '08.

[15]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

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

[17]  Peng-Jun Wan,et al.  Distributed heuristics for connected dominating sets in wireless ad hoc networks , 2002, Journal of Communications and Networks.

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

[19]  Guohui Lin,et al.  Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length , 1999, Inf. Process. Lett..

[20]  Minglu Li,et al.  On Reducing Broadcast Transmission Cost and Redundancy in Ad Hoc Wireless Networks Using Directional Antennas , 2010, IEEE Transactions on Vehicular Technology.

[21]  Michael Segal,et al.  Improved approximation algorithms for connected sensor cover , 2007, Wirel. Networks.

[22]  Yi Zhu,et al.  Efficient Distributed Algorithms for Topology Control Problem with Shortest Path Constraints , 2009, Discret. Math. Algorithms Appl..

[23]  W. Edwin Clark,et al.  Tight Upper Bounds for the Domination Numbers of Graphs With Given Order and Minimum Degree , 1997, Electron. J. Comb..

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

[25]  Hans Eriksson,et al.  MBONE: the multicast backbone , 1994, CACM.

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

[27]  Kurt Mehlhorn,et al.  A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..

[28]  Loren Schwiebert,et al.  Power efficient topologies for wireless sensor networks , 2001, International Conference on Parallel Processing, 2001..

[29]  Lusheng Wang,et al.  The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points , 2001, COCOON.

[30]  Ru-Sheng Liu,et al.  A Backbone Routing Protocol Based on the Connected Dominating Set in Ad Hoc Networks , 2009, 2009 WRI World Congress on Computer Science and Information Engineering.

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

[32]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[33]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[34]  Weili Wu,et al.  Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[35]  Jennie C. Hansen,et al.  Comparison of Two CDS Algorithms on Random Unit Ball Graphs , 2005, ALENEX/ANALCO.

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

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

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

[39]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

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

[41]  Paul Strauch,et al.  A robust 60 GHz wireless network with parallel relaying , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[42]  Weili Wu,et al.  Algorithms for connected set cover problem and fault-tolerant connected set cover problem , 2009, Theor. Comput. Sci..

[43]  Dirk Timmermann,et al.  Distributed obstacle localization in large wireless sensor networks , 2006, IWCMC '06.

[44]  Milan Ruzic,et al.  Uniform deterministic dictionaries , 2008, TALG.

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

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

[47]  Weili Wu,et al.  An exact algorithm for minimum CDS with shortest path constraint in wireless networks , 2011, Optim. Lett..

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

[49]  Minming Li,et al.  Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks , 2009, ISAAC.

[50]  Weili Wu,et al.  (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs , 2008, COCOON.

[51]  Marek Karpinski,et al.  New Approximation Algorithms for the Steiner Tree Problems , 1997, J. Comb. Optim..

[52]  Michael Segal,et al.  Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks , 2001 .

[53]  Donghyun Kim,et al.  Constructing weakly connected dominating set for secure clustering in distributed sensor network , 2010, Journal of Combinatorial Optimization.

[54]  Hans Jürgen Prömel,et al.  A 1.598 approximation algorithm for the Steiner problem in graphs , 1999, SODA '99.

[55]  Donghyun Kim,et al.  Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs , 2008, COCOA.

[56]  Weiping Shang,et al.  On minimum m-connected k-dominating set problem in unit disc graphs , 2008, J. Comb. Optim..

[57]  Thomas Erlebach,et al.  A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs , 2009, WAOA.

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

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

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

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

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

[63]  Thomas Erlebach,et al.  Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs , 2006, APPROX-RANDOM.

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

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

[66]  Aravind Srinivasan,et al.  Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..

[67]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[68]  Xiuzhen Cheng,et al.  Virtual backbone construction in multihop ad hoc wireless networks: Research Articles , 2006 .

[69]  Arunabha Sen,et al.  Broadcast scheduling algorithms for radio networks , 1995, Proceedings of MILCOM '95.

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

[71]  Xiang-Yang Li,et al.  Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks , 2006, Mob. Networks Appl..

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

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

[74]  Deying Li,et al.  Construction of strongly connected dominating sets in asymmetric multihop wireless networks , 2009, Theor. Comput. Sci..

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

[76]  Weili Wu,et al.  Construction of directional virtual backbones with minimum routing cost in wireless networks , 2011, 2011 Proceedings IEEE INFOCOM.

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

[78]  Changyuan Yu,et al.  A 5+epsilon-approximation algorithm for minimum weighted dominating set in unit disk graph , 2009, Theor. Comput. Sci..

[79]  B. M. Waxman.  New Approximation Algorithms for the Steiner Tree Problem , 1989 .

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

[81]  Wei Wang,et al.  PTAS for the minimum weighted dominating set in growth bounded graphs , 2012, J. Glob. Optim..

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

[83]  Shiow-Fen Hwang,et al.  A study of recent research trends and experimental guidelines in mobile ad-hoc network , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[84]  Weili Wu,et al.  A better constant-factor approximation for weighted dominating set in unit disk graph , 2009, J. Comb. Optim..

[85]  Maw-Shang Chang,et al.  Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs , 1992, SIAM J. Comput..

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

[87]  Vaduvur Bharghavan,et al.  Enhancing ad hoc routing with dynamic virtual infrastructures , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[88]  Johann Hurink,et al.  Approximation schemes for wireless networks , 2008, TALG.