Advanced SearchSearch Tips
A Multi-Start Local Search Algorithm Finding Minimum Connected Dominating Set in Wireless Sensor Networks
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A Multi-Start Local Search Algorithm Finding Minimum Connected Dominating Set in Wireless Sensor Networks
Kang, Seung-Ho; Jeong, Min-A; Lee, Seong Ro;
  PDF(new window)
As a method to increase the scalability and efficiency of wireless sensor networks, a scheme to construct networks hierarchically has received considerable attention among researchers. Researches on the methods to construct wireless networks hierarchically have been conducted focusing on how to select nodes such that they constitute a backbone network of wireless network. Nodes comprising the backbone network should be connected themselves and can cover other remaining nodes. A problem to find the minimum number of nodes which satisfy these conditions is known as the minimum connected dominating set (MCDS) problem. The MCDS problem is NP-hard, therefore there is no efficient algorithm which guarantee the optimal solutions for this problem at present. In this paper, we propose a novel multi-start local search algorithm to solve the MCDS problem efficiently. For the performance evaluation of the proposed method, we conduct extensive experiments and report the results.
wireless sensor networks;backbone network;minimum connected dominating set;multi-start local search algorithm;
 Cited by
I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: a survey," Computer Netw., vol. 38, pp. 393- 422, Mar. 2002. crossref(new window)

I. F. Akyildiz and I. H. Kasimoglu, "Wireless sensor and actor networks: research challenges," Ad Hoc Netw., vol. 2, pp. 351- 367, 2004. crossref(new window)

I. F. Akyildiz, T. Melodia, and K. R. Chowdhury, "A survey on wireless multimedia sensor networks," Computer Netw., vol. 51, pp. 921-960, 2007. crossref(new window)

K. Akkaya and M. Younis, "A survey on routing protocols for wireless sensor networks," Ad Hoc Netw., vol. 3, pp. 325-349, May 2005. crossref(new window)

S. W. Han, I. S. Jeong, and S. H. Kang, "Low latency and energy efficient routing tree for wireless sensor networks with multiple mobile sinks," J. Netw. Comput. Appl., vol. 36, pp. 156-166, 2013. crossref(new window)

S. H. Kang, K. Y. Kim, W. Y. Lee, I. Song, M. A. Jung, and S. R. Lee, "A branch and bound algorithm to find a routing tree having minimum wiener index in sensor networks with high mobile base node," J. KICS, vol. 35, pp. 466-473, 2010.

S. H. Kang, M. S. Choi, M. A. Jung, and S. R. Lee, "A pareto ant colony optimization algorithm for application specific routing in wireless sensor & actor networks," J. KICS, vol. 36, pp. 346-353, 2011. crossref(new window)

S. Ni, Y. C. Tseng, Y. S. Chen, and J. P. Sheu, "The broadcast storm problem in a mobile ad hoc network," in Proc. ACM/IEEE Int. Conf. Mob. Comput. Netw., vol. 8, no. 2-3, pp. 153-167, Mar. 2002.

M. A. Labrador and P. M. Wightman, "Topology control in wireless sensor networks: with a companion simulation tool for teaching and research," Springer Science+Business, Media B. V., 2009.

S. Lee, D. Levin, V. Gopalakrishnan, and B. Bhattacharjee, "Backbone construction in selfish wireless networks," in Proc. ACM SIGMETRICS '07, pp. 121-132, 2007.

S. Balaji, K. Kannan, and Y. B. Venkatakrishnan, "Total dominating set based algorithm for connected dominating set in Ad hoc wireless networks," WSEAS Trans. Mathematics, vol. 12, pp. 1164-1172, 2013.

B. Das and V. Bharghavan, "Routing in adhoc networks using minimum connected dominating sets," IEEE ICC '97, vol. 1, pp. 376-380, Montreal, 1997.

C. Zheng, L. Yin, and S. Sun, "Construction of d-hop connected dominating sets in wireless sensor networks," Procedia Eng., vol 15, pp. 3416-3420, 2011. crossref(new window)

J. Yu, N. Wang, G. Wang, and D. Yu, "Connected dominating set in wireless as hoc and sensor networks - A comprehensive survey," Computer Commun., vol. 36, pp. 121-134, 2013. crossref(new window)