Encyclopedia of Algorithms

Living Edition
| Editors: Ming-Yang Kao

Fault-Tolerant Connected Dominating Set

  • Donghyun Kim
  • Wei Wang
  • Weili Wu
  • Alade O. Tokuta
Living reference work entry
DOI: https://doi.org/10.1007/978-3-642-27848-8_622-1

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...

Keywords

Connected dominating set Approximation algorithm Graph algorithm Vertex connectivity Fault tolerance Virtual backbone 
This is a preview of subscription content, log in to check access

Recommended Reading

  1. 1.
    Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20:374–387CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San FranciscoMATHGoogle Scholar
  3. 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–1772Google Scholar
  4. 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. 5.
    Diestel R (2005) Graph theory, 3rd edn. Springer, HeidelbergMATHGoogle Scholar
  6. 6.
    Clark BN, Colbourn CJ, Johnson DS (1990) Unit disk graphs. Discret Math 86:165–177CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Wang F, Thai MT, Du DZ (2009) 2-connected virtual backbone in wireless network. IEEE Trans Wirel Commun 8(3):1230–1237CrossRefGoogle Scholar
  8. 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–106CrossRefMathSciNetGoogle Scholar
  9. 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–139CrossRefMATHMathSciNetGoogle Scholar
  10. 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–59CrossRefMathSciNetGoogle Scholar
  11. 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, OrlandoGoogle Scholar
  12. 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 KongGoogle Scholar
  13. 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 KongGoogle Scholar
  14. 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–509Google Scholar
  15. 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 DiegoGoogle Scholar
  16. 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–1510CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Donghyun Kim
    • 1
  • Wei Wang
    • 2
  • Weili Wu
    • 3
  • Alade O. Tokuta
    • 1
  1. 1.Department of Mathematics and Physics, North Carolina Central UniversityDurham, NCUSA
  2. 2.School of Mathematics and Statistics, Xi’an Jiaotong UniversityXi’an, ShaanxiP.R. China
  3. 3.Department of Computer Science, University of Texas at DallasRichardson, TXUSA