Abstract
Some of the most popular routing protocols for wireless sensor networks require a virtual backbone for efficient communication between the sensors. Connected dominating sets (CDS) have been studied as a method of choosing nodes to be in the backbone. The traditional approach is to assume that the transmission range of each node is given and to minimize the number of nodes in the CDS representing the backbone. A recently introduced alternative strategy is based on the concept of k-bottleneck connected dominating set (k-BCDS), which, given a positive integer k, minimizes the transmission range of the nodes that ensures a CDS of size k exists in the network. This paper provides a 6-approximate distributed algorithm for the k-BCDS problem. The results of empirical evaluation of the proposed algorithm are also included.
Similar content being viewed by others
References
Akkaya K., Younis M.: A survey on routing protocols for wireless sensor networks. Ad Hoc Netw. 3(3), 325–349 (2005)
Attiya H., Welch J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. Wiley, Hoboken (2004)
Biaz S., Ji Y.: A survey and comparison on localisation algorithms for wireless ad hoc networks. Int. J. Mob. Commun. 3(4), 374–410 (2005)
Blum J., Ding M., Thaeler A., Cheng X.: Connected dominating set in sensor networks and MANETs. In: Du, D.-Z., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization., pp. 329–369. Springer Science+Business Media Inc, New York (2005)
Butenko S., Kahruman-Anderoglu S., Ursulenko O.: On connected domination in unit ball graphs. Optim. Lett. 5, 195–205 (2011)
Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: IEEE International Conference on Communications, ‘Towards the Knowledge Millennium’, vol. 1, pp. 376–380. Montreal (1997)
Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
Girod, L., Estrin, D.: Robust range estimation using acoustic and multimodal sensing. In: Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2001), Maui, (2001)
Gonzalez T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293–306 (1985)
Guha S., Khuller S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374–387 (1996)
Jia L., Rajaraman R., Suel T.: An efficient distributed algorithm for constructing small dominating sets. Distrib. Comput. 15, 193–205 (2002)
Li, X.-Y., Stojmenovic, I.: Broadcasting and topology control in wireless ad hoc networks. Handbook of Algorithms for Mobile and Wireless Networking and Computing, pp. 239–261 (2005)
Linial N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193–201 (1992)
Miller C. E., Tucker A. W., Zemlin R. A.: Integer programming formulations and traveling salesman problems. J. ACM 7, 326–329 (1960)
Min M., Du H., Jia X., Huang C. X., Huang S. C.-H., Wu W.: Improving construction for connected dominating set with Steiner tree in wireless sensor networks. J. Glob. Optim. 35, 111–119 (2006)
Savvides, A., Han, C.-C., Srivastava, M. B.: Dynamic fine-grained localization in ad-hoc networks of sensors. In: MobiCom ’01: Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, pp. 166–179. ACM, New York (2001)
Shin I., Shen Y., Thai M. T.: On approximation of dominating tree in wireless sensor networks. Optim. Lett. 4, 393–403 (2010)
Thai M. T., Wang F., Liu D., Zhu S., Du D.-Z.: Connected dominating sets in wireless networks with different transmission ranges. IEEE Trans. Mob. Comput. 6, 721–730 (2007)
Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: DIALM ’99: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7–14. ACM, New York (1999)
Wu J., Wu B.: A transmission range reduction scheme for power-aware broadcasting in ad hoc networks using connected dominating sets. IEEE Veh. Technol. Conf. 5, 2906–2909 (2003)
Wu W., Gao X., Pardalos P. M., Du D.-Z.: Wireless networking, dominating and packing. Optim. Lett. 4, 347–358 (2010)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported by AFOSR Award No. FA9550-08-1-0483 and NSF Grant OISE-0853804.
Rights and permissions
About this article
Cite this article
Verma, A., Butenko, S. A distributed approximation algorithm for the bottleneck connected dominating set problem. Optim Lett 6, 1583–1595 (2012). https://doi.org/10.1007/s11590-011-0314-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-011-0314-2