Abstract
Using a connected dominating set (CDS) to serve as the virtual backbone of a wireless network is an effective way to save energy and alleviate broadcasting storm. Since nodes may fail due to an accidental damage or energy depletion, it is desirable that the virtual backbone is fault tolerant. A node set \(C\) is an \(m\)-fold connected dominating set (\(m\)-fold CDS) of graph \(G\) if every node in \(V(G)\setminus C\) has at least \(m\) neighbors in \(C\) and the subgraph of \(G\) induced by \(C\) is connected. In this paper, we will present a greedy algorithm to compute an \(m\)-fold CDS in a general graph, which has size at most \(2+\ln (\Delta +m-2)\) times that of a minimum \(m\)-fold CDS, where \(\Delta \) is the maximum degree of the graph. This result improves on the previous best known performance ratio of \(2H(\Delta +m-1)\) for this problem, where \(H(\cdot )\) is the Harmonic number.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cheng X, Huang X, Li D, Wu W, Du D (2003) A polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks 42:202–208
Dai F, Wu J (2006) On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks. J Parallel Distrib Comput 66(7):947–958
Du DZ, Graham RL, Pardalos PM, Wan PJ, Wu WL, Zhao W. (2008) Analysis of greedy approximation with nonsubmodular potential functions. In: Proceedings 19th ACMSIAM symposium on discrete algorithms, pp 167–175
Du D, Ko K, Hu X (2012) Design and analysis of approximation algorithms. Springer, New York
Ephremides A, Wieselthier J, Baker D (1987) A design concept for reliable mobile radio networks with frequency hopping signaling. Proc IEEE 75:56–73
Gao X, Wang Y, Li X, Wu W (2009) Analysis on theoretical bounds for approximating dominating set problems. Discret Math Algorithms Appl 1(1):71–84
Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374–387
Li D, Liu L, Yang H (2009) Minimum connected \(r\)-hop \(k\)-dominating set in wireless networks. Discret Math Algorithms Appl 1:45–58
Li M, Wan P, Yao F (2009) Tighter approximation bounds for minimum CDS in wireless ad hoc networks. ISAAC’2009 LNCS 5878:699–709
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:118–139
Ruan L, Du H, Jia X, Wu W, Li Y, Ko K (2004) A greedy approximation for minimum connected dominating sets. Theor Comput Sci 329(1):325–330
Shang W, Yao F, Wan P, Hu X (2008) On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs. J Comb Optim 16:99–106
Thai M, Zhang N, Tiwari R, Xu X (2007) On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs. Theor Comput Sci 385:49–59
Wan P, Alzoubi K, Frieder O (2004) Distributed construction of connected dominating set in wireless ad hoc networks. ACM/Springer Mob Netw Appl 9(2):141–149
Wan P, Wang L, Yao F. (2008) Two-phased approximation algorithms for minimum CDS in wireless ad hoc networks. In: IEEE ICDCS, pp 337–344
Wang F, Thai M, Du D (2009) On the construction of 2-connected virtual backbone in wireless networks. IEEE Trans Wirel Commun 8(3):1230–1237
Wang W, Kim D, An M, Gao W, Li X, Zhang Z, Wu W (2012) On construction of quality fault-tolerant virtual backbone in wireless networks. IEEE/ACM Trans Netw. doi:10.1109/TNET.2012.2227791
Wu W, Du H, Jia X, Li Y, Huang S (2006) Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theor Comput Sci 352(1–3):1–7
Wu Y, Wang F, Thai M, Li Y (2007) Constructing \(k\)-connected \(m\)-dominating sets in wireless sensor networks. In: Military communications conference, pp 1–7
Zhang Z, Gao XF, Wu WL, Du DZ (2009) A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks. J Glob Optim 45:451–458
Zhang Z, Liu Q, Li D (2009) Two algorithms for connected \(r\)-hop \(k\)-dominationg set. Discret Math Algorithms Appl 1(4):485–498
Acknowledgments
This research is supported by NSFC (61222201) and SRFDP (20126501110001), and by National Science Foundation of USA under grants CNS0831579 and CCF0728851.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhou, J., Zhang, Z., Wu, W. et al. A greedy algorithm for the fault-tolerant connected dominating set in a general graph. J Comb Optim 28, 310–319 (2014). https://doi.org/10.1007/s10878-013-9638-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-013-9638-4