Skip to main content
SpringerLink
Log in

Routing-Cost Constrained Connected Dominating Set

  • Living reference work entry
  • First Online:
Encyclopedia of Algorithms

Years and Authors of Summarized Original Work

2013; Du, Wu, Ye, Li, Lee, Xu

2012; Du, Ye, Zhong, Wang, Lee, Park

2011; Du, Ye, Wu, Lee, Li, Du, Howard

Problem Definition

Connected dominating set CDS is typically adapted in wireless multihop networks such as wireless sensor, ad hoc networks. In order to achieve routing efficiency, a virtual backbone which is inspired by the backbone in wired networks is often used to improve routing because it can reduce the path search space and the routing table size [3]. According to [8, 10], there are many methods to construct a virtual backbone, and the competitive approach is connected dominating set(CDS). The detailed definition of CDS is as follows. Given a connected graph G(V, E) represents as a wireless sensor network, where V is the set of sensor nodes and E is the set of edges connecting sensor nodes in V. If there is a subset D(D ⊆ V ), each sensor node in V either belonging to D or adjacent to a sensor node in D, then we call Dis a...

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

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Cheng X, Ding M, Du DH, Jia X (2006) Virtual backbone construction in multihop ad hoc wireless networks. Wirel Commun Mobile Comput 6:183–190

    Article  Google Scholar 

  2. Ding L, Gao X, Wu W, Lee W, Zhu X, Du D-Z (2010) Distributed construction of connected dominating sets with minimum routing cost in wireless network. In: Proceedings of the 30th international conference on distributed computing systems (ICDCS), Genova, pp 448–457

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  5. Ding L, Wu W, Willson JK, Du H (2011) Construction of directional virtual backbones with minimum routing cost in wireless networks. In: Proceedings of 30th IEEE international conference on computer communications (INFOCOM), Shanghai

    Google Scholar 

  6. Ding L, Wu W, Willson J, Du H, Lee W (2012) Efficient virtual backbone construction with routing cost constraint in wireless networks using directional antennas. IEEE Trans Mobile Comput 11(7): 1102–1112

    Article  Google Scholar 

  7. Du H, Ye Q, Zhong J, Wang Y, Lee W, Park H (2010) PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks. J Comb Optim Appl 6508:252–259

    MathSciNet  Google Scholar 

  8. Du H, Ye Q, Wu W, Lee W, Li D, Du D, Howard S (2011) Constant approximation for virtual backbone construction with guaranteed routing cost in wireless sensor networks. In: Proceedings of the 30th IEEE international conference on computer communications (INFOCOM), Shanghai

    Google Scholar 

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

    Article  Google Scholar 

  10. Hongwei Du, Weili Wu, Qiang Ye, Deying Li, Wonjun Lee, Xuepeng Xu(2013) CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks. IEEE Trans Parallel Distrib Syst 24(4):652–661

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen, China

    Hongwei Du & Haiming Luo

Authors
  1. Hongwei Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haiming Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hongwei Du .

Editor information

Editors and Affiliations

  1. Dept. Electrical Engineering & Computer Science, Northwestern University, Evanston, Illinois, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this entry

Cite this entry

Du, H., Luo, H. (2014). Routing-Cost Constrained Connected Dominating Set. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-3-642-27848-8_621-1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27848-8_621-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Online ISBN: 978-3-642-27848-8

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation