Browse > Article

A Branch and Bound Algorithm to Find a Routing Tree Having Minimum Wiener Index in Sensor Networks with High Mobile Base Node  

Kang, Seung-Ho (목포대학교 중점연구소)
Kim, Ki-Young (목포대학교 정보전자공학과)
Lee, Woo-Young (목포대학교 정보통신공학과)
Song, Iick-Ho (한국과학기술원 전기및전자공학과)
Jung, Min-A (목포대학교 컴퓨터공학과)
Lee, Seong-Ro (목포대학교 정보전자공학과)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.35, no.5A, 2010 , pp. 466-473 More about this Journal
Abstract
Several protocols which are based on tree topology to guarantee the important metrics such as energy efficiency in sensor networks have been proposed. However, studies on the effect of topologies in sensor networks, where base node has a high mobility, are very few. In this paper, we propose a minimum Wiener index tree as a suitable topology to the wireless sensor networks with high mobile base node. The minimum Wiener index spanning tree problem which aims to find a tree with minimum Wiener index from a given weighted graph was proved to be NP-hard. We designed a branch and bound algorithm for this problem. To evaluate the performance of proposed tree, the comparisons with minimum spanning tree in terms of transmission distance, energy consumption during one round, and network lifetime was performed by simulations. Our proposed tree outperformed in transmission distance and energy efficiency but underperformed in lifetime.
Keywords
MWT; Tree Topology; Sensor Networks; MST; Energy; Efficiency; Network Lifetime;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Okdem and D. Karaboga, "Routing in Wireless Sensor Networks Using an Ant Colony Optimization Router Chip," Sensors, Vol.9, pp.909-921, Feb., 2009.   DOI   ScienceOn
2 D. Ganesan, et al., "Networking Issues in Wireless Sensor Networks," Journal of Parallel and Distributed Computing, Vol.64, pp.799-814, July, 2004.   DOI   ScienceOn
3 W. R. Heinzelman, et al., "Energy-Efficient Communication Protocol for Wireless Microsensor Networks," In Proc. of the 33rd Hawaii International Conference on System Sciences, pp.1-10, 2000.
4 J. Hromkovic, Algorithmics for Hard Problems, 2nd Edition, Springer, 2004.
5 S. Hussain and O. Islam, "An Energy Efficient Spanning Tree Based Multi-hop Routing in Wireless Sensor Networks," In Proc. of Wireless Communications and Networking Conference, pp.4383-4388, 2007.
6 S. Hussain and O. Islam, "Genetic Algorithm for Energy Efficient Trees in Wireless Sensor Networks," Advanced Intelligent Environments, Springer, pp.1-14, 2008.
7 R. Khanna, H. Liu, and H. H. Chen, "Self-Organization of Sensor Networks Using Genetic Algorihtms," In Proc. of IEEE Intl. Conf. on Communications(ICC), pp.3377-3382, 2006.
8 I. F. Akyildiz, et al., "Wireless sensor networks: a survey," Computer Networks, Vol.38, pp.393-422, Mar., 2002.   DOI   ScienceOn
9 I. F. Akyildiz, et al., "A survey on wireless multimedia sensor networks," Computer Networks, Vol.51, pp.921-960, 2007.   DOI   ScienceOn
10 M. Fischermann, et al., "Wiener index versus maximum degree in trees," Discrete Applied Mathematics, Vol.122, pp.127-137, 2002.   DOI   ScienceOn