A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks
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.
KeywordsCooperative Control Unit Disk Graph Mobile Commerce Breadth First Search Current Vertex
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead. In Proc. 31st Symp. Found. Computer Science, pages 514–522, 1990.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- B. Das and V. Bharghavan. Routing in ad-hoc networks using minimum connected dominating sets. In International Conference on Communications, pages 376–380, 1997.Google Scholar
- 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.Google Scholar
- 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.Google Scholar