Skip to main content
SpringerLink
Log in

Fault-Tolerant Connected Dominating Set

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

  • 279 Accesses

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. Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20:374–387

    Article  MATH  MathSciNet  Google Scholar 

  2. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco

    MATH  Google Scholar 

  3. Sinha P, Sivakumar R, Bharghavan V (2001) Enhancing ad hoc routing with dynamic virtual infrastructures. In: Proceedings of the 20th annual joint conference of the IEEE computer and communications societies, Anchorage, vol 3, pp 1763–1772

    Google Scholar 

  4. Dai F, Wu J (2005), On constructing k-connected k-dominating set in wireless network. In: Proceedings of the 19th IEEE international parallel and distributed processing symposium, Denver

    Google Scholar 

  5. Diestel R (2005) Graph theory, 3rd edn. Springer, Heidelberg

    MATH  Google Scholar 

  6. Clark BN, Colbourn CJ, Johnson DS (1990) Unit disk graphs. Discret Math 86:165–177

    Article  MATH  MathSciNet  Google Scholar 

  7. Wang F, Thai MT, Du DZ (2009) 2-connected virtual backbone in wireless network. IEEE Trans Wirel Commun 8(3):1230–1237

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. Li Y, Wu Y, Ai C, Beyah R (2012) On the construction of k-connected m-dominating sets in wireless networks. J Comb Optim 23(1):118–139

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  11. Wu Y, Wang F, Thai MT, Li Y (2007) Constructing k-connected m-dominating sets in wireless sensor networks. In: Proceedings of the 2007 military communications conference, Orlando

    Google Scholar 

  12. Wu Y, Li Y (2008) Construction algorithms for k-connected m-dominating sets in wireless sensor networks. In: Proceedings of 9th ACM international symposium on mobile ad hoc networking and computing, Hong Kong

    Google Scholar 

  13. Zhang N, Shin I, Zou F, Wu W, Thai MT (2008) Trade-off scheme for fault tolerant connected dominating sets on size and diameter. In: Proceeding of the 1st ACM international workshop on foudations of wireless ad hoc and sensor networking and computing (FOWANC’08), Hong Kong

    Google Scholar 

  14. Kim D, Gao X, Zou F, Du DZ (2011) Construction of fault-tolerant virtual backbones in wireless networks. Handbook on security and networks. World Scientific, Hackensack, pp 488–509

    Google Scholar 

  15. Kim D, Wang W, Li X, Zhang Z, Wu W (2010) 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, San Diego

    Google Scholar 

  16. Wang W, Kim D, An MK, Gao W, Li X, Zhang Z, Wu W (2013) On construction of quality fault-tolerant virtual backbone in wireless networks. IEEE/ACM Trans Netw 21(5):1499–1510

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Physics, North Carolina Central University, Durham, NC, USA

    Donghyun Kim & Alade O. Tokuta

  2. School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an, Shaanxi, P.R. China

    Wei Wang

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

    Weili Wu

Authors
  1. Donghyun Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei Wang
    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. Alade O. Tokuta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Donghyun Kim .

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

Kim, D., Wang, W., Wu, W., Tokuta, A.O. (2014). Fault-Tolerant Connected Dominating Set. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-3-642-27848-8_622-1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27848-8_622-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