Skip to main content
SpringerLink
Log in

Connected Dominating Set in Wireless Networks

  • Reference work entry
  • First Online:
Handbook of Combinatorial Optimization

Abstract

In a graph G = ( 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 3,400.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 549.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, A survey on sensor networks. IEEE Commun. Mag. 40, 102–114 (2002)

    Article  Google Scholar 

  2. K.M. Alzoubi, P.-J. Wan, O. Frieder, Distributed heuristics for connected dominating sets in wireless ad hoc networks. IEEE ComSoc/KICS J. Commun. Netw. 4(1), 22–29 (2002)

    Google Scholar 

  3. K.M. Alzoubi, P.-J. Wan, O. Frieder, Message-optimal connected dominating sets in mobile ad hoc networks, in Proceedings of the 3rd ACM International Symposium on Mobile ad hoc Networking and Computing, Lausanne, Switzerland, 2002

    Google Scholar 

  4. K.M. Alzoubi, P.-J. Wan, O. Frieder, Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks, in ICDCS ’03: Proceedings of the 23rd International Conference on Distributed Computing Systems 96, Washington, DC, 2003

    Google Scholar 

  5. C. Ambühl, T. Erlebach, M. Mihalak, M. Nunkesser, Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs, in Proceedings of the 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems. Lecture Notes in Computer Science, vol. 4110 (Springer, Berlin/New York, 2006), pp. 3–14

    Google Scholar 

  6. P. Berman, V. Ramaiyer, Improved approximations for the Steiner tree problem. J. Algorithms 17, 381–408 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. V. Bharghavan, B. Das, Routing in ad hoc networks using minimum connected dominating sets, in International Conference on Communication, Montréal, 1997

    Google Scholar 

  8. S. Butenko, O. Ursulenko, On minimum connected dominating set problem in unit-ball (Preprint Submitted to Elervier Science, 2007)

    Google Scholar 

  9. M. Cadei, M.X. Cheng, X. Cheng, D.-Z. Du, Connected domination in ad hoc wireless networks, in Proceedings of the Sixth International Conference on Computer Science and Informatics (CS&I’2002), Durham, NC, 2002

    Google Scholar 

  10. M.-S. Chang, Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J. Comput. 27, 1671–1694 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  11. Y.P. Chen, A.L. Liestman, Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks, in MobiHoc ’02: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing (ACM, New York, 2002), pp. 165–172

    Google Scholar 

  12. D. Chen, D.-Z. Du, X. Hu, G.-H. Lin, L. Wang, G. Xue, Approximations for Steiner trees with minimum number of Steiner points. J. Glob. Optim. 18, 17–33 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. X. Cheng, D.-Z. Du, Virtual backbone-based routing in ad hoc wireless networks. Technical report 02–002, Department of Computer Science and Engineering, University of Minnesota, 2002

    Google Scholar 

  14. X. Cheng, X. Huang, D. Li, W. Wu, D.-Z. Du, A polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks 42, 202–208 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. X. Cheng, M. Ding, D.H. Du, X. Jia, Virtual backbone construction in multihop ad hoc wireless networks: research articles. Wirel. Commun. Mobile Comput. 6(2), 183–190 (2006)

    Article  Google Scholar 

  16. W.E. Clark, L.A. Dunning, Tight upper bounds for the domination numbers of graphs with given order and minimum degree. Electron. J. Comb. 4(1), R26 (1997). 25p

    MathSciNet  Google Scholar 

  17. B.N. Clark, C.J. Colbourn, D.S. Johnson, Unit disk graphs. Discret. Math. 86, 165–177 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  18. F. Dai, J. Wu, On constructing k-connected k-dominating set in wireless network, in Proceedings of 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS’05), Denver, 2005

    Google Scholar 

  19. D. Dai, C. Yu, A (5 + ε)-approximation algorithm for minimum weighted dominating set in unit disk graph. Theor. Comput. Sci. 410, 756–765 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  20. B. Das, R. Sivakumar, V. Bharghavan, Routing in ad hoc networks using a spine, in Proceedings of the International Conference on Computers and Communication Networks, Las Vegas, NV, 1997

    Google Scholar 

  21. L. Ding, Y. Shao, M. Li, On reducing broadcast transmission cost and redundancy in ad hoc wireless networks using directional antennas, in WCNC (IEEE, Piscataway, 2008)

    Google Scholar 

  22. L. Ding, X. Gao, W. Wu, W. Lee, X. Zhu, D.-Z. Du, An exact algorithm for minimum cds with shortest path constraint in wireless networks. Optim. Lett. 5(2), 297–306 (2010)

    Article  MathSciNet  Google Scholar 

  23. L. Ding, X. Gao, W. Wu, W. Lee, X. Zhu, D.-Z. Du, Distributed construction of connected dominating sets with minimum routing cost in wireless networks, Proceedings of IEEE ICDCS, Genova, 2010

    Google Scholar 

  24. L. Ding, W. Wu, W.J.K. Willson, H. Du, W. Lee, D.-Z. Du, Efficient algorithms for topology control problem with routing cost constraints in wireless networks. IEEE Trans. Parallel Distrib. Syst. 22(10), 1601–1609 (2010)

    Article  Google Scholar 

  25. L. Ding, W. Wu, J.K. Willson, H. Du, W. Lee, Construction of directional virtual backbones with minimum routing cost in wireless networks, in IEEE INFOCOM, Shanghai, 2011

    Google Scholar 

  26. C.R. Dow, P.J. Lin, S.C. Chen, J.H. Lin, S.F. Hwang, A study of recent research trends and experimental guidelines in mobile ad hoc networks, in Proceedings of the 19th International Conference on Advanced Information Networking and Applications (AINA’05), Taipei, 2005, pp. 72–77

    Google Scholar 

  27. D.-Z. Du, L. Wang, B. Xu, The Euclidean Bottleneck Steiner tree and Steiner tree with minimum number of Steiner points, in COCOON, Guilin, 2001, pp. 509–518

    Google Scholar 

  28. D.-Z. Du, M.T. Thai, Y. Li, D. Liu, S. Zhu, Strongly connected dominating sets in wireless sensor networks with unidirectional links, in Proceedings of APWEB, Harbin, 2006

    Google Scholar 

  29. D.-Z. Du, R.L. Graham, P.M. Pardalos, P.-J. Wan, W. Wu, W. Zhao, Analysis of greedy approximations with nonsubmodular potential functions, in Proceedings of the 19th Annual ACM-SIAM Symposium on Dicrete Algorithms (SODA), San Francisco, 2008, pp. 167–175

    Google Scholar 

  30. H. Du, W. Wu, S. Shan, D. Kim, W. Lee, Constructing weakly connected dominating set for secure clustering in distributed sensor network. J. Comb. Optim. 23(2), 301–307 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  31. H. Du, Q. Ye, J. Zhong, Y. Wang, W. Lee, H. Park, PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks, in COCOA, vol. 1, Kailua-Kona, HI, 2010, pp. 252–259

    Google Scholar 

  32. H. Du, Q. Ye, W. Wu, W. Lee, D. Li, D.-Z. Du, S. Howard, Constant approximation for virtual backbone construction with guarantee routing cost in wireless sensor networks, in IEEE INFOCOM, Shanghai, 2011

    Google Scholar 

  33. D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, A. Srinivasan, Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons, in SODA ’03: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia, 2003), pp. 717–724

    Google Scholar 

  34. A. Ephremides, J. Wieselthier, D. Baker, A design concept for reliable mobile radio networks with frequency hopping signaling. Proc. IEEE 75(1), 56–73 (1987)

    Article  Google Scholar 

  35. H. Eriksson, MBone: the multicast backbone. Commun. ACM 37, 54–60 (1994)

    Article  Google Scholar 

  36. T. Erlebach, M. Mihalak, A (4+epsilon)-approximation for the minimum-weight dominating set problem in unit disk graphs, in WAOA, ed. by E. Bampis, K. Jansen, vol. 5893, 2010, pp. 135–146. http://dx.doi.org/10.1007/978-3-642-12450-1_13

  37. U. Feige, A threshold of ln n for approximating set-cover, in Proceedings of the 28th ACM Symposium on Theory of Computing, Philadelphia, PA, 1996, pp. 314–318

    Google Scholar 

  38. S. Funke, A. Kesselman, U. Meyer, A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Trans. Sens. Netw. 2, 444–453 (2006)

    Article  Google Scholar 

  39. S. Funke, A. Kesselman, F. Kuhn, Z. Lotker, M. Sega, Improved approximation algorithms for connected sensor cover. Wirel. Netw. 13, 153–164 (2007)

    Article  Google Scholar 

  40. X. Gao, Y. Huang, Z. Zhang, W. Wu, (6 + ε)-approximation for minimum weight dominating set in unit disk graphs, in COCOON, Dalian, 2008, pp. 551–557

    Google Scholar 

  41. X. Gao, Y. Wang, X. Li, W. Wu, Analysis on theoretical bonds for approximating dominating set problems. Discret. Math. Algorithms Appl. 1(1), 71–84 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  42. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, San Francisco, 1979)

    MATH  Google Scholar 

  43. S. Guha, S. Khuller, Approximation algorithms for connected dominating sets. Algorithmica 20, 374–387 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  44. J.C. Hansen, E. Schmutz, Comparison of two CDS algorithms on random unit ball Ggraphs, in Proceedings of the Seventh Workshop Algorithm Engineering and Experiments (ALENEX 05) (SIAM, Philadelphia, 2005)

    Google Scholar 

  45. S. Hougardy, H.J. Proommel, A 1.598 approximation algorithm for the Steiner problem in graphs, in Proceedings of ACM-SIAM Symposium on Discrete Algorithms, Baltimore, 1999, pp. 448–453

    Google Scholar 

  46. H. Huang, A.W. Richa, M. Segal, Approximation algorithms for the mobile piercing set problem with applications to clustering in Ad-Hoc networks. ACM Springer Mobile Netw. Appl. 9(2), 151–161 (2004)

    Article  Google Scholar 

  47. Y. Huang, X. Gao, Z. Zhang, W. Wu, A better constant-factor approximation for weighted dominating set in unit disk graph. J. Comb. Optim. 18, 179–194 (2008)

    Article  MathSciNet  Google Scholar 

  48. M.L. Huson, A. Sen, Broadcast scheduling algorithms for radio networks, in IEEE Military Communications Conference (MILCOM ’95), San Diego, vol. 2, 1995, pp. 647–651

    Google Scholar 

  49. D.S. Johnson, Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256–278 (1974)

    Article  MATH  Google Scholar 

  50. M. Karpinski, A. Zelikovsky, New approximation algorithms for the Steiner tree problem. J. Comb. Optim. 1, 47–65 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  51. D. Kim, Y. Wu, Y. Li, F. Zou, D.-Z. Du, Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Trans. Parallel Distrib. Syst. 20(2), 147–157 (2009)

    Article  Google Scholar 

  52. D. Kim, W. Wang, X. Li, Z. Zhang, W. Wu, A new constant factor approximation for computing 3-connected m-dominating sets in homogeneous wireless networks, in Proceedings of the 29th IEEE Conference on Computer Communications (IEEE INFOCOM), San Diego, 2010

    Google Scholar 

  53. D. Kim, Z. Zhang, X. Li, W. Wang, W. Wu, D.-Z. Du, A better approximation algorithm for computing connected dominating sets in unit ball graphs. IEEE Trans. Mobile Comput. 9(8), 1108–1118 (2010)

    Article  Google Scholar 

  54. Y. Li, S. Zhu, M.T. Thai, D.-Z. Du, Localized construction of connected dominating set in wireless networks, in NSF International Workshop on Theoretical Aspects of Wireless Ad Hoc, Sensor and Peer-to-Peer Networks (TAWN04), Chicago, 2004

    Google Scholar 

  55. D. Li, H. Du, P.-J. Wan, X. Gao, Z. Zhang, W. Wu, Construction of strongly connected dominating sets in asymmetric multihop wireless networks. Theor. Comput. Sci. 410(8–10), 661–669 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  56. D. Li, L. Liu, H. Yang, Minimum connected r-hop k-dominating set in wireless networks. Discret. Math. Algorithms Appl. 1(1), 45–57 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  57. M. Li, P.-J. Wan, F.F. Yao, Tighter approximation bounds for minimum CDS in wireless ad hoc networks, in ISAAC’2009, Honolulu, 2009

    Google Scholar 

  58. Y.S. Li, M.T. Thai, F. Wang, C.-W. Yi, P.-J. Wan, D.-Z. Du, On greedy construction of connected dominating sets in wireless networks. Wiley J. Wirel. Commun. Mobile Comput. 5, 927–932 (2005)

    Article  Google Scholar 

  59. Y. Li, Y. Wu, C. Ai, R. Beyah, On the construction of k-connected m-dominating Sets in wireless networks. J. Comb. Optim. 23, 118–139 (2010)

    Article  MathSciNet  Google Scholar 

  60. G.-H. Lin, G.L. Xue, Steiner tree problem with minimum number of Steiner points and bounded edge-length. Inf. Process. Lett. 69, 53–57 (1999)

    Article  MathSciNet  Google Scholar 

  61. M. Min, X. Huang, C.-H. Huang, W. Wu, H. Du, X. Jia, Improving construction for connected dominating set with Steiner tree in wireless sensor networks. J. Glob. Optim. 35, 111–119 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  62. K. Mohammed, L. Gewali, V. Muthukumar, Generating quality dominating sets for sensor network, in Proceedings of IEEE ICCIMA, Las Vegas, 2005

    Google Scholar 

  63. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, J.-P. Sheu, The broadcast storm problem in a mobile ad hoc network, in Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, Seattle. MobiCom ’99 (ACM, New York, 1999), pp. 151–162

    Google Scholar 

  64. T. Nieberg, J. Hurink, W. Kern, Approximation schemes for wireless networks. ACM Trans. Algorithms 4, 1–17 (2008)

    Article  MathSciNet  Google Scholar 

  65. F. Reichenbach, R. Salomon, D. Timmermann, Distributed obstacle localization in large wireless sensor networks, in Proceedings of ACM IWCMC, Vancouver, 2006

    Google Scholar 

  66. G. Robin, A. Zelikovsky, Improved Steiner trees approximation in graphs, in SIAM-ACM Symposium on Discrete Algorithms (SODA), San Francisco, 2000, pp. 770–779

    Google Scholar 

  67. L. Ruan, H. Du, X. Jia, W. Wu, Y. Li, K.-I. Ko, A greedy approximation for minimum connected dominating set. Theor. Comput. Sci. 329, 325–330 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  68. A. Salhieh, J. Weinmann, M. Kochha, L. Schwiebert, Power efficient topologies for wireless sensor networks, in ICPP’2001, Valencia, 2001, pp. 156–163

    Google Scholar 

  69. E. Sampathkumar, H.B. Walikar, The connected domination number of a graph. J. Math. Phys. Sci. 13, 607–613 (1979)

    MathSciNet  MATH  Google Scholar 

  70. W. Shang, F. Yao, P. Wan, X. Hu, On minimum m-connected k-dominating set problem in unit disc graphs. J. Comb. Optim. 16, 99–106 (2007)

    Article  MathSciNet  Google Scholar 

  71. P. Sinha, R. Sivakumar, V. Bharghavan, Enhancing ad hoc routing with dynamic virtual infrastructures, in Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3 (IEEE, Piscataway, 2001), pp. 1763–1772

    Google Scholar 

  72. R. Sivakumar, B. Das, V. Bharghavan, An improved spine-based infrastructure for routing in ad hoc networks, in IEEE Symposium on Computer and Communications, Athens, 1998

    Google Scholar 

  73. I. Stojmenovic, M. Seddigh, J. Zunic, Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, in Proceedings of the IEEE Hawaii International Conference on System Sciences (IEEE Computer Society, Los Alamitos, 2001)

    Google Scholar 

  74. M.T. Thai, N. Zhang, R. Tiwari, X. Xu, On approximation algorithms of k-connected m-dominating sets in disk graphs. Theor. Comput. Sci. 358, 49–59 (2007)

    Article  MathSciNet  Google Scholar 

  75. Y.-P. Tsai, T.-L Hsu, R.-S. Liu, Y.-K. Ho, A backbone routing protocol based on the connected dominating set in ad hoc networks. World Congr. Comput. Sci. Inf. Eng. 1, 14–18 (2009)

    Google Scholar 

  76. P.-J. Wan, K.M. Alzoubi, O. Frieder, Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Netw. Appl. 9(2), 141–149 (2004). ACM/Springer

    Article  Google Scholar 

  77. P.-J. Wan, L. Wang, F. Yao, Two-phased approximation algorithms for minimum CDS in wireless ad hoc networks, in IEEE ICDCS, Beijing, 2008, pp. 337–344

    Google Scholar 

  78. Y. Wang, X.Y. Li, Localized construction of bounded degree and planar spanner for wireless ad hoc networks. Mobile Netw. Appl. 11(2), 161–175 (2006)

    Article  Google Scholar 

  79. F. Wang, M.T. Thai, D.-Z. Du, 2-connected virtual backbone in wireless network. IEEE Trans. Wirel. Commun. 8(3), 1230–1237 (2007). Accepted with revisions

    Article  Google Scholar 

  80. Z. Wang, W. Wang, J. Kim, B.M. Thuraisingham, W. Wu, PTAS for the minimum weighted dominating set in growth bounded graphs. J. Glob. Optim. 54(3), 641–648 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  81. J. Willson, X. Gao, Z. Qu, Y. Zhu, Y. Li, W. Wu, Efficient Distributed Algorithms for Topology Control Problem with Shortest Path Constraints. Discret. Math. Algorithms Appl. 1, 437–461 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  82. J. Wu, H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, in Proceedings of the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Seattle, 1999, pp. 7–14

    Google Scholar 

  83. Y. Wu, Y. Li, Construction algorithms for k-connected m-dominating sets in wireless sensor networks, in 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (Mobihoc 2008) (ACM, New York, 2008)

    Google Scholar 

  84. W. Wu, H. Du, X. Jia, Y. Li, S.C.-H. Huang, Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theor. Comput. Sci. 352(1–3), 1–7 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  85. Y. Wu, F. Wang, M.T. Thai, Y. Li, Constructing k-connected m-dominating sets in wireless sensor networks, in Proceedings of 2007 Military Communications Conference (MILCOM07), Orlando, 2007

    Google Scholar 

  86. C. Zong, Sphere Packings (Springer, New York, 1999)

    MATH  Google Scholar 

  87. Z. Zhang, X. Gao, W. Wu, D.-Z. Du, A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks. J. Glob. Optim. 45(3), 451–458 (2008). published online, Dec. 2008

    Article  MathSciNet  Google Scholar 

  88. Z. Zhang, X. Gao, W. Wu, Algorithms for connected set cover problem and fault-tolerant connected set cover problem. Theor. Comput. Sci. 410, 812–817 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  89. X. Zhong, J. Wang, N. Hu, Connected dominating set in 3-dimensional space for ad hoc network, in Proceedings of the IEEE Wireless Communication and Networking Conference, Hong Kong, 2007

    Google Scholar 

  90. F. Zou, Y. Wang, X. Li, X. Xu, H. Du, P. Wan, W. Wu, New approximations for minimum-weighted dominating set and minimum-weighted connected dominating set on unit disk graphs. Theor. Comput. Sci. 412(3), 198–208 (2009)

    Article  MathSciNet  Google Scholar 

  91. F. Zou, X. Li, D. Kim, W. Wu, Construction of minimum connected dominating set in v3-dimensional wireless network, in Proceedings of Third International Conference Wireless Algorithms, Systems and Applications (WASA 2008), Dallas, 2008

    Google Scholar 

  92. F. Zou, X. Li, D. Kim, W. Wu, Two constant approximation algorithms for node-weighted Steiner Tree in unit disk graphs, in COCOA, 2008, pp. 278–285. http://dx.doi.org/10.1007/978-3-540-85097-7_26

  93. F. Zou, X. Li, D. Kim, W. Wu, Construction of minimum connected dominating set in 3-dimensional wireless network, in Wireless Algorithms, Systems, and Applications, vol. 5258 (Springer, Berlin, 2008), pp. 134–140

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Hongjie Du

  2. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Ling Ding

  3. Institute of Technology, University of Washington Tacoma, 358426, Tacoma, WA, USA

    Weili Wu

  4. Department of Mathematics and Computer Science, North Carolina Central University, 1801 Fayetteville Street, 27707, Durham, NC, USA

    Donghyun Kim

  5. Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, 32611, Gainesville, FL, USA

    Panos M. Pardalos

  6. Department of Computer Science, The University of New Mexico, 87131, Albuquerque, NM, USA

    James Willson

Authors
  1. Hongjie Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ling Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weili Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Donghyun Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. James Willson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Hongjie Du , Ling Ding , Weili Wu , Donghyun Kim , Panos M. Pardalos or James Willson .

Editor information

Editors and Affiliations

  1. Department of Industrial and Systems Eng, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  2. Department of Computer Science, University of Texas, Dallas, Richardson, Texas, USA

    Ding-Zhu Du

  3. Dept. Comp. Sci. & Engineering, University of California, San Diego, La Jolla, California, USA

    Ronald L. Graham

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this entry

Cite this entry

Du, H., Ding, L., Wu, W., Kim, D., Pardalos, P.M., Willson, J. (2013). Connected Dominating Set in Wireless Networks. In: Pardalos, P., Du, DZ., Graham, R. (eds) Handbook of Combinatorial Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7997-1_42

Download citation

Publish with us

Policies and ethics

Search

Navigation