Skip to main content
SpringerLink
Log in

Fault-Tolerant Connected Dominating Set

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 39 Accesses

Years and Authors of Summarized Original Work

  • 2010; Kim, Wang, Li, Zhang, Wu

  • 2013; Wang, Kim, An, Gao, Li, Zhang, Wu

Problem Definition

The problem of interest is to find a virtual backbone with a certain level of fault tolerance. Virtual backbone is a subset of nodes to be in charge of routing messages among the other nodes and is a very effective tool to improve the communication efficiency of various wireless networks such as mobile ad hoc networks and wireless sensor networks [3]. It is known that a virtual backbone with smaller cardinality works more efficiently. Without the fault-tolerance consideration, the problem of computing minimum cardinality virtual backbone can be formulated as a minimum connected dominating set problem [1], which is a well-known NP-hard problem [2]. To improve the fault tolerance of a connected dominating set C in homogenous wireless networks, C needs to exhibit two additional properties [4]:

  • k-connectivity: C has to be k-vertex-connected so that the...

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.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. Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20:374–387

    Article  MathSciNet  MATH  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  MathSciNet  MATH  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  MATH  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  MathSciNet  MATH  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  MATH  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: Proceedings of the 1st ACM international workshop on foundations 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, 1801 Fayetteville Street, 27707, Durham, NC, USA

    Donghyun Kim

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

    Wei Wang

  3. College of Computer Science and Technology, Taiyuan University of Technology, Taiyuan, Shanxi Province, China

    Weili Wu

  4. Department of Computer Science, California State University, Los Angeles, USA

    Weili Wu

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

    Weili Wu

  6. Department of Mathematics and Physics, North Carolina Central University, 1801 Fayetteville Street, 27707, Durham, NC, USA

    Alade O. Tokuta

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. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Kim, D., Wang, W., Wu, W., Tokuta, A.O. (2016). Fault-Tolerant Connected Dominating Set. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_622

Download citation

Publish with us

Policies and ethics

Search

Navigation