Abstract
Connected dominating sets (CDS) that serve as a virtual backbone are now widely used to facilitate routing in wireless networks. A k-connected m-dominating set (kmCDS) is necessary for fault tolerance and routing flexibility. In order to construct a kmCDS with the minimum size, some approximation algorithms have been proposed in literature. However, the proposed algorithms either only consider some special cases where k=1, 2 or k≤m, or not easy to implement, or cannot provide performance ratio. In this paper, we propose a centralized heuristic algorithm, CSAA, which is easy to implement, and two distributed algorithms, DDA and DPA, which are deterministic and probabilistic methods respectively, to construct a kmCDS for general k and m. Theoretical analysis and simulation results indicate that our algorithms are efficient and effective.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alzoubi KM, Wan P-J, Frieder O (2002a) New distributed algorithm for connected dominating set in wireless ad hoc networks. In: Proc. 35th Hawaii international conference on system sciences, Big Island, Hawaii
Alzoubi KM, Wan P-J, Frieder O (2002b) Distributed heuristics for connected dominating sets in wireless ad hoc networks. J Commun Netw 4(1):22–29
Alzoubi KM, Wan P-J, Frieder O (2002c) Message-optimal connected dominating sets in mobile ad hoc networks. In: Proc. 3rd ACM international symposium on mobile ad hoc networking and computing, EPFL Lausanne, Switzerland
Bettstetter C (2002) On the minimum node degree and connectivity of a wireless multihop network. In: Proc. 3rd ACM international symposium on mobile ad hoc networking and computing, EPFL Lausanne, Switzerland
Cardei M, Cheng X, Du D-Z (2002) Connected domination in ad hoc wireless networks. In: Proc. 6th international conference on computer science and informatics
Cheng X, Ding M, Du D, Jia X (2006) Virtual backbone construction in multihop ad hoc wireless networks. Wirel Commun Mob Comput 6(2):183–190
Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press, Cambridge. ISBN 0-262-03293-7
Dai F, Wu J (2005) On constructing k-connected k-dominating set in wireless network. In: Proc. 19th international parallel and distributed processing symposium, Denver, Colorado
Das B, Bharghavan V (1997) Routing in ad-hoc networks using minimum connected dominating sets. In: Proc. international conference on communications, Montreal, Canada, June 1997
Das B, Sivakumar R, Bharghavan V (1997) Routing in ad hoc networks using a spine. In: Proc. 6th international conference on computers and communications networks, Las Vegas, NV, September 1997
Ephremides A, Wieselthier J, Baker D (1987) A design concept for reliable mobile radio networks with frequency hopping signaling. Proc IEEE 75:56–73
Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374–387
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 Syst 20(2):147–157
Li Y, Zhu S, Thai MT, Du D-Z (2004) Localized construction of connected dominating set in wireless networks. In: NSF international workshop on theoretical aspects of wireless ad hoc, sensor and peer-to-peer networks, Chicago, June 2004
Ni S-Y, Tseng YC, Chen Y-S, Shen J-P (1999) The broadcast storm problem in a mobile ad hoc network. In: Proc. 5th annual international conference on mobile computing and networking, August 1999, pp 151–162
Shang W, Yao F, Wan P, Hu X (2007) Algorithms for minimum m-connected k-dominating set problem. In: COCOA 2007. LNCS, vol 4616. Springer, Berlin, pp 182–190
Sivakumar R, Das B, Bharghavan V (1998) An improved spine-based infrastructure for routing in ad hoc networks. In: IEEE symposium on computers and communications, Athens, Greece, June 1998
Thai MT, 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-J, Alzoubi KM, Frieder O (2002) Distributed construction of connected dominating sets in wireless ad hoc networks. In: Proc 21st annual joint conference of the IEEE computer and communications societies, vol 3, pp 1597–1604
Wang F, Thai MT, Du D-Z (2009) On the construction of 2-connected virtual backbone in wireless networks. IEEE Trans Wirel Commun 8(3):1230–1237
West DB (2001) Introduction to graph theory, 2nd edn. Prentice-Hall, New York. ISBN 0-13-014400-2
Wu J, Li H (1999) On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proc. 3rd international workshop on discrete algorithms and methods for mobile computing and communications, August 1999, pp 7–14,
Wu Y, Wang F, Thai MT, Li Y (2007) Constructing k-connected m-dominating sets in wireless sensor networks. In: Military communications conference, Orlando, FL, October 29–31, 2007
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, Y., Wu, Y., Ai, C. et al. On the construction of k-connected m-dominating sets in wireless networks. J Comb Optim 23, 118–139 (2012). https://doi.org/10.1007/s10878-010-9346-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-010-9346-2