Abstract
Given a graph G = (V, E), a dominating set D is a subset of V such that any vertex not in D is adjacent to at least one vertex in D. Efficient algorithms for computing the minimum connected dominating set (MCDS) are essential for solving many practical problems, such as finding a minimum size backbone in ad hoc networks. Wireless ad hoc networks appear in a wide variety of applications, including mobile commerce, search and discovery, and military battlefield. In this chapter we propose a new efficient heuristic algorithm for the minimum connected dominating set problem. The algorithm starts with a feasible solution containing all vertices of the graph. Then it reduces the size of the CDS by excluding some vertices using a greedy criterion. We also discuss a distributed version of this algorithm. The results of numerical testing show that, despite its simplicity, the proposed algorithm is competitive with other existing approaches.
Corresponding author
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K. M. Alzoubi, P.-J. Wan, and O. Frieder. Distributed heuristics for connected dominating set in wireless ad hoc networks. IEEE ComSoc/KICS Journal on Communication Networks, 4 (1): 22–29, 2002.
B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead. In Proc. 31st Symp. Found. Computer Science, pages 514–522, 1990.
B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM (JACM), 41 (1): 153–180, 1994.
S. Butenko, X. Cheng, D.-Z. Du, and P. M. Pardalos. On the construction of virtual backbone for ad hoc wireless network. In S. Butenko, R. Murphey, and P. M. Pardalos, editors, Cooperative Control: Models, Applications and Algorithms, pages 43–54. Kluwer Academic Publishers, 2002.
X. Cheng, X. Huang, D. Li, W. Wu, and D.-Z. Du. Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. To appear in Networks, 2003.
B. Das and V. Bharghavan. Routing in ad-hoc networks using minimum connected dominating sets. In International Conference on Communications, pages 376–380, 1997.
M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco CA, 1979.
S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20 (4): 374–387, 1998.
H. B. Hunt III, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, and R.E. Stearns. NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs, J. Algorithms, 26: 238–274, 1998.
N. Malpani, J. Welch, and N. Vaidya. Leader election algorithms for mobile ad hoc networks. In Proc. Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pages 96–103, 2000.
M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz. Simple heuristics for unit disk graphs. Networks, 25: 59–68, 1995.
L. A. Sanchis. Experimental analysis of heuristic algorithms for the dominating set problem. Algorithmica, 33: 3–18, 2002.
I. Stojmenovic, M. Seddigh, and J. Zunic. Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. In Proc. IEEE Hawaii Int. Conf on System Sciences, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
Butenko, S., Cheng, X., Oliveira, C.A., Pardalos, P.M. (2004). A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks. In: Butenko, S., Murphey, R., Pardalos, P.M. (eds) Recent Developments in Cooperative Control and Optimization. Cooperative Systems, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0219-3_4
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0219-3_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7947-8
Online ISBN: 978-1-4613-0219-3
eBook Packages: Springer Book Archive