Skip to main content
SpringerLink
Log in
Book cover

Handbook of Combinatorial Optimization pp 329–369Cite as

Connected Dominating Set in Sensor Networks and MANETs

  • Chapter

This is a preview of subscription content, 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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Adjih, P. Jacquet, and L. Viennot, Computing connected dominated sets with multipoint relays, Technical Report, INRIA, Oct. 2002.

    Google Scholar 

  2. K. M. Alzoubi, P.-J. Wan, O. Frieder, Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks, to appear in ACM Mobile Networks and Applications.

    Google Scholar 

  3. K. M. Alzoubi, P.-J. Wan, O. Frieder: Maximal Independent Set, Weakly Connected Dominating Set, and Induced Spanners for Mobile Ad Hoc Networks, International Journal of Foundations of Computer Science, Vol. 14, No. 2, pp. 287–303, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  4. K.M. Alzoubi, P.-J. Wan and O. Frieder, New Distributed Algorithm for Connected Dominating Set in Wireleess Ad Hoc Networks, Proceedings of the 35th Hawaii International Conference on System Sciences, Big Island, Hawaii, 2002.

    Google Scholar 

  5. K.M. Alzoubi, P.-J. Wan and O. Frieder, Distributed Heuristics for Connected Dominating Sets in Wireless Ad Hoc Networks, Journal of Communications and Networks, Vol. 4, No. 1, Mar. 2002.

    Google Scholar 

  6. K.M. Alzoubi, P.-J. Wan and O. Frieder, Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks, MOBIHOC, EPFL Lausanne, Switzerland, 2002.

    Google Scholar 

  7. A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh, Max-Min D-Cluster Formation in Wireless Ad Hoc Networks, Proc. IEEE INFOCOM, Tel Aviv, Israel, 2000.

    Google Scholar 

  8. B. An and S. Papavassiliou, A mobility-based clustering approach to support mobility management and multicast routing in mobile ad-hoc wireless networks, International Journal of Network Management, 11, pp. 387–395, 2001.

    Article  Google Scholar 

  9. H. Attiya and J. Welch, Distributed computing: fundamentals, simulations and advanced topics, McGraw-Hill Publishing Company, 1998.

    Google Scholar 

  10. B. Awerbuch, Optimal Distributed Algorithm for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems, Proceedings of the 19th ACM Symposium on Theory of Computing, ACM, pp. 230–240, 1987.

    Google Scholar 

  11. S. Basagni, Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks, Proc. IEEE 50th Vehicular Technology Conference, Piscataway, NJ, 1999.

    Google Scholar 

  12. J. Blum, A. Eskandarian, and L. Hoffman, Mobility Management of IVC Networks, Proc. IEEE Intelligent Vehicles Symposium, Columbus, OH, 2003.

    Google Scholar 

  13. S. Butenko, X. Cheng, D.-Z. Du, and P.M. Pardalos, On the construction of virtual backbone for ad hoc wireless networks, In S. Butenko, R. Murphey, and P.M. Pardalos, editors, Cooperative Control: Models, Applications and Algorithms, pp. 43–54, Kluwer Academic Publishers, 2003.

    Google Scholar 

  14. S. Butenko, X. Cheng, C. Oliveira, and P.M. Pardalos, A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks, In S. Butenko, R. Murphey, and P.M. Pardalos, editors, Recent Developments in Cooperative Control and Optimization, pp. 61–73, Kluwer Academic Publishers, 2004.

    Google Scholar 

  15. S. Butenko, C. Oliveira, and P.M. Pardalos, A new algorithm for the minimum connected dominating set problem on ad hoc wireless networks, Proc. of CCCT’03, Vol. V, pp.39–44, International Institute of Informatics and Systematics (IIIS), 2003.

    Google Scholar 

  16. M. Cadei, X. Cheng and D.-Z. Du, Connected Domination in Ad Hoc Wireless Networks, Proc. 6th International Conference on Computer Science and Informatics, 2002.

    Google Scholar 

  17. G. Calinescu, I. Mandoiu, P.-J. Wan and A. Zelikovsky, Selecting forwarding neighbors in wireless ad hoc networks, manuscript, 2001.

    Google Scholar 

  18. Y.-L. Chang and C.-C. Hsu, Routing in wireless/mobile ad-hoc networks via dynamic group construction, Mobile Networks and Applications, 5, pp. 27–37, 2000.

    Article  Google Scholar 

  19. B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, Span: An energy-efficient coordination algorithm for topology maintenance in Ad Hoc wireless networks, Wireless Networks, 8, pp. 481–494, 2002.

    Article  MATH  Google Scholar 

  20. D. Chen, D.-Z. Du, X. Hu, G.-H. Lin, L. Wang, and G. Xue, Approximations for Steiner trees with minimum number of Steiner points, Journal of Global Optimization, Vol. 18, pp. 17–33, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  21. Y. Chen, A. Liestman, Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks, ACM MobiHoc, June 2002.

    Google Scholar 

  22. X. Chen and J. Shen, Reducing connected dominating set size with multipoint relays in ad hoc wireless networks Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 539–543, May 2004.

    Google Scholar 

  23. X. Cheng, Routing Issues in Ad Hoc Wireless Networks, PhD Thesis, Department of Computer Science, University of Minnesota, 2002.

    Google Scholar 

  24. X. Cheng, M. Ding, and D. Chen, An approximation algorithm for connected dominating set in ad hoc networks, Proc. of International Workshop on Theoretical Aspects of Wireless Ad Hoc, Sensor, and Peer-to-Peer Networks (TAWN), 2004.

    Google Scholar 

  25. X. Cheng, M. Ding, D.H. Du, and X. Jia, On The Construction of Connected Dominating Set in Ad Hoc Wireless Networks, to appear in Special Issue on Ad Hoc Networks of Wireless Communications and Mobile Computing, 2004.

    Google Scholar 

  26. X. Cheng, X. Huang, D. Li, W. Wu, and D.-Z. Du, Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks, Networks, Vol. 42, No. 4, pp. 202–208, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  27. C.-C. Chiang and M. Gerla, Routing and Multicast in Multihop, Mobile Wireless Networks, Proc. IEEE ICUPC’97, San Diego, CA, 1997.

    Google Scholar 

  28. I. Cidon and O. Mokryn, Propagation and Leader Election in Multihop Broadcast Environment, Proc. 12th Int. Symp. Distr. Computing, pp. 104–119, Greece, Spt. 1998.

    Google Scholar 

  29. B. N. Clark, C. J. Colbourn and D. S. Johnson, Unit disk graphs, Discrete Mathematics, Vol. 86, 1990, pp. 165–177.

    Article  MATH  MathSciNet  Google Scholar 

  30. T. Clausen, P. Jacquet, A. Laouiti, P. Minet, P. Muhlethaler, and L. Viennot, Optimized link state routing protocol, IETF Internet Draft, draft-ietf-manet-olsr-05.txt, October 2001.

    Google Scholar 

  31. F. Dai and J. Wu, An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks, to appear in IEEE Transactions on Parallel and Distributed Systems, 2004.

    Google Scholar 

  32. F. Dai and J. Wu, Distributed dominate pruning in ad hoc wireless networks, Proc. ICC, 2003.

    Google Scholar 

  33. Bevan Das and Vaduvur Bharghavan, Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets, International Conference on Communications, Montreal, Canada, June 1997.

    Google Scholar 

  34. Bevan Das, Raghupathy Sivakumar and Vaduvur Bharghavan, Routing in Ad Hoc Networks Using a virtual backbone, IC3N’97, pp.1–20, 1997.

    Google Scholar 

  35. Bevan Das, Raghupathy Sivakumar and Vaduvur Bharghavan, Routing in Ad Hoc Networks Using a Spine, International Conference on Computers and Communications Networks, Las Vegas, NV. Sept. 1997.

    Google Scholar 

  36. S. Datta and I. Stojmenovic, Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks, Cluster Computing, 5(2), pp. 169–178, 2002.

    Article  Google Scholar 

  37. Budhaditya Deb, Sudeept Bhatnagar, and Badri Nath, Multi-resolution State Retrieval in Sensor Networks, First IEEE Workshop on Sensor Network Protocols And Applications (SNPA), Anchorage 2003

    Google Scholar 

  38. M. Ding, X. Cheng, and G. Xue, Aggregation tree construction in sensor networks, Proc. of IEEE VTC, 2003.

    Google Scholar 

  39. D.-Z. Du, L. Wang, and B. Xu, The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points, COCOON’01, pp. 509–518, 2001.

    Google Scholar 

  40. A. Ephremides, J. Wieselthier, and D. Baker, A design concept for reliable mobile radio networks with frequency hopping signaling, Proceedings of the IEEE, 75, pp. 56–73, 1987.

    Article  Google Scholar 

  41. M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, Freeman, San Frncisco, 1978.

    Google Scholar 

  42. R. De Gaudenzi, T. Garde, F. Giannetti, and M. Luise, DS-CDMA techniques for mobile and personal satellite communications: An overview IEEE Second Symposium on Communications and Vehicular Technology in the Benelux, pp.113–127, 2–3 Nov. 1994.

    Google Scholar 

  43. M. Gerla and J. T. Tsai, Multicluster, mobile, multimedia, radio network, ACM/Baltzer Journal on Wireless Networks, 1, pp. 255–265, 1995.

    Article  Google Scholar 

  44. S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica, 20(4), pp. 374–387, Apr. 1998.

    Article  MATH  MathSciNet  Google Scholar 

  45. A. Helmy, Efficient resource discovery in wireless adhoc networks: contacts do help, Manuscript, 2004.

    Google Scholar 

  46. P. Jacquet, P. Muhlethaler, A. Qayyum, A. Laouiti, L. Viennot and T. Clausen, Optimized link state routing protocol, IETF Internet Draft, draft-ietf-manet-olsr-04.txt, March 2001.

    Google Scholar 

  47. D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks, Proc. Mobile Compiling edited by T. Imielinski and H. Korth, Kluwer Academic Publisher, 1996.

    Google Scholar 

  48. U. Kozat, L. Tassiulas, Service discovery in mobile ad hoc networks: an overall perspective on architectureal choices and network layer support issues, Ad Hoc Networks Journal, In press, 2003.

    Google Scholar 

  49. B. Liang and Z.J. Haas, Virtual backbone generation and maintenance in ad hoc network mobility management, IEEE INFOCOM 2000, pp.1293–1302.

    Google Scholar 

  50. J. Li, J. Jannotti, D. S. J. D. Couto, D. R. Karger, and R. Morris, A scalable location service for geographic ad hoc routing, Proc. of the sixth annual international conference on Mobile computing and networking, Boston, MA, 2000.

    Google Scholar 

  51. H. Lim and C. Kim, Multicast Tree Construction and Flooding in Wireless Ad Hoc Networks, Proc. 3rd ACM international workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, Boston, MA, pp. 61–68, 2000.

    Google Scholar 

  52. H. Lim and C. Kim, Flooding in wireless ad hoc networks, Computer Communications Journal, Vol. 24(3–4), pp. 353–363, 2001.

    Article  Google Scholar 

  53. G.-H. Lin and G.L. Xue, Steiner tree problem with minimum number of Steiner points and bounded edge-length, Information Processing Letters, Vol. 69, pp. 53–57, 1999.

    Article  MathSciNet  Google Scholar 

  54. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of the ACM, Vol. 41(5), pp. 960–981, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  55. M. V. Marathe et al., Simple heuristics for unit disk graphs, Networks, vol. 25, pp. 59–68, 1995.

    MATH  MathSciNet  Google Scholar 

  56. A. B. McDonald and T. F. Znati, Mobility-based framework for adaptive clustering in wireless ad hoc networks, IEEE Journal on Selected Areas in Communications, 17, pp. 1466–1487, 1999.

    Article  Google Scholar 

  57. M. Min and D.-Z. Du, A reliable virtual backbone scheme in mobile ad-hoc networks, manuscript, 2004.

    Google Scholar 

  58. M. Min, C.X. Huang, S. C.-H. Huang, W. Wu, H. Du, and X. Jia, Improving construction of connected dominating set with Steiner tree in wireless sensor networks, submitted.

    Google Scholar 

  59. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen and J.-P. Sheu, The broadcast storm problem in a mobile ad hoc network, Proc. MOBICOM, Seattle, Aug. 1999, pp. 151–162.

    Google Scholar 

  60. C. Perkins and E. Royer, Ad-hoc on-demand distance vector routing, Proc. 2nd IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100, 1999.

    Google Scholar 

  61. A. Qayyum, L. Viennot, and A. Laouiti, Multipoint relaying for flooding broadcast messages in mobile wireless networks, HICSS02, pp. 3866–3875, January 2002.

    Google Scholar 

  62. L. Ruan, D.H. Du, X. Jia, W. Wu, Y. Li, and K.-I Ko A greedy approximation for minimum connected dominating sets, manuscripts, 2004.

    Google Scholar 

  63. J. Shaikh, J. Solano, I. Stojmenovic, and J. Wu, New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks, Proc. of WLN Workshop (in conjunction to IEEE Conference on Local Computer Networks), pp. 726–735, Oct. 2003.

    Google Scholar 

  64. R. Sivakumar, P. Sinha and V. Bharghavan, CEDAR: a core-extraction distributed ad hoc routing algorithm, Selected Areas in Communications, IEEE Journal on, Vol. 17(8), Aug. 1999, pp. 1454–1465.

    Article  Google Scholar 

  65. P. Sinha, R. Sivakumar and V. Bharghavan, Enhancing ad hoc routing with dynamic virtual infrastructures, INFOCOM 2001, Vol. 3, pp. 1763–1772.

    Google Scholar 

  66. R. Sivakumar, B. Das, and V. Bharghavan, An Improved Spine-based Infrastructure for Routing in Ad Hoc Networks, IEEE Symposium on Computers and Communications, Athens, Greece, June 1998.

    Google Scholar 

  67. I. Stojmenovic, M. Seddigh, J. Zunic, Dominating Sets and Neighbor Elimination Based on Broadcasting Algorithms in wireless networks, Proc. IEEE Hawaii Int. Conf. on System Sciences, 1988.

    Google Scholar 

  68. A. Tanenbaum, Computer Networks, Prentice Hall, 1996.

    Google Scholar 

  69. P.-J. Wan, K.M. Alzoubi and O. Frieder, Distributed Construction of Connected Dominating Sets in Wireless Ad Hoc Networks, IEEE INFOCOM, 2002.

    Google Scholar 

  70. J. Wu, Extended Dominating-Set-Based Rounting in Ad Hoc Wireless Networks with Undirectional Links, IEEE Trans. on Parallel and Distributed Systems, pp. 866–881, Sept. 2002.

    Google Scholar 

  71. J. Wu, An enhanced approach to determine a small forward node set based on multipoint relays IEEE 58th Vehicular Technology Conference, Vol. 4, pp. 2774–2777, October 2003.

    Google Scholar 

  72. J. Wu, F. Dai, M. Gao, and I. Stojmenovic, On Calculating Power-Aware Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks, Journal of Communications and Networks, Vol. 5, No. 2, pp. 169–178, March 2002.

    MATH  Google Scholar 

  73. J. Wu and F. Dai, Broadcasting in ad hoc networks based on self-pruning, IEEE INFOCOM, 2003.

    Google Scholar 

  74. J. Wu and F. Dai, On Locality of Dominating Set in Ad Hoc Networks with Switch-On/Off Operations, Journal of Interconnection Networks, a special issue on Algorithms for Networks, Vol. 3, No. 3 & 4, pp. 129–147, Sept. & Dec. 2002.

    Article  Google Scholar 

  75. J. Wu and F. Dai, On Locality of Dominating Set in Ad Hoc Networks with Switch On/Off Operations, Proc. of the 6th International Conference on Parallel Architectures, Algorithms, and Networks (I-SPAN02), 2002.

    Google Scholar 

  76. J. Wu and H. Li, On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks, Proc. of the Third International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7–14, Aug. 1999.

    Google Scholar 

  77. J. Wu, M. Gao, and I. Stojmenovic, On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Net-works, Proc. of International Conference on Parallel Processing (ICPP), 346–356, 2001.

    Google Scholar 

  78. J. Wu and B. Wu, A Transmission Range Reduction Scheme for Power-Aware Broadcasting in Ad Hoc Networks Using Connected Dominating Sets, Proc. of 2003 IEEE Semiannual Vehicular Technology Conference (VTC2003-fall), Oct. 2003.

    Google Scholar 

  79. J. Wu, B. Wu, and I. Stojmenovic, Power-Aware Broadcasting and Activity Scheduling in Ad Hoc Wireless Networks Using Connected Dominating Sets, Proc. of IASTED International Conference on Wireless and Optical Communication (WOC 2002), 2002.

    Google Scholar 

  80. J. Wu, B. Wu, and I. Stojmenovic, Power-Aware Broadcasting and Activity Scheduling in Ad Hoc Wireless Networks Using Connected Dominating Sets, Wireless Communications and Mobile Computing, a special issue on Research in Ad Hoc Networking, Smart Sensing, and Pervasive Computing, Vol. 3, No. 4, pp. 425–438, June 2003.

    Article  MATH  Google Scholar 

  81. W. Wu, H. Du, X. Jia, M. Min, C.H. Huang, and X. Cheng, Maximal independent set and minimum connected dominating set in unit disk graphs, manuscripts, 2004.

    Google Scholar 

  82. Y. Xu, J. Heidemann, and D. Estrin, Geography-informed energy conservation for Ad Hoc routing, MobiCom 2001, pp.70–84, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The George Washington University, Washington, DC, 20002

    Jeremy Blum, Min Ding, Andrew Thaeler & Xiuzhen Cheng

Authors
  1. Jeremy Blum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Min Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrew Thaeler
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiuzhen Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Minnesota, Minneapolis, MN

    Ding-Zhu Du

  2. University of Florida, Gainesville, FL

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Kluwer Academic Publishers

About this chapter

Cite this chapter

Blum, J., Ding, M., Thaeler, A., Cheng, X. (2004). Connected Dominating Set in Sensor Networks and MANETs. In: Du, DZ., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization. Springer, Boston, MA. https://doi.org/10.1007/0-387-23830-1_8

Download citation

Publish with us

Policies and ethics

Search

Navigation