Low latency and energy efficient routing tree for wireless sensor networks with multiple mobile sinks

Authors:
Seung-Wan Han;In-Seon Jeong;Seung-Ho Kang
Affiliations:
Cyber Security-Convergence Research Laboratory, Electronics and Telecommunications Research Institute, 218 Gajeongno, Yuseong-gu, Daejeon 305-700, Republic of Korea;Genomics Division, National Academy of Agricultural Science, 150 Suin-ro, Seodun-dong Gwonseon-gu, Suwon 441-707, Republic of Korea;Division of Fusion and Convergence of Mathematical Sciences, National Institute for Mathematical Sciences, KT Daedeok 2 Research Center, 463-1 Jeonmin-dong, Yuseong-gu, Daejeon 305-811, Republic o ...
Venue:
Journal of Network and Computer Applications
Year:
2013

Citing 14
Cited 0

Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Algorithmics for Hard Problems

Algorithmics for Hard Problems
Wiener index versus maximum degree in trees

Discrete Applied Mathematics
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Power efficient data gathering and aggregation in wireless sensor networks

ACM SIGMOD Record
Networking issues in wireless sensor networks

Journal of Parallel and Distributed Computing
A survey on wireless multimedia sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Spanning tree based algorithms for low latency and energy efficient data aggregation enhanced convergecast (DAC) in wireless sensor networks

Ad Hoc Networks
Efficient routing to mobile sinks in wireless sensor networks

WICON '07 Proceedings of the 3rd international conference on Wireless internet
Energy efficient and seamless data collection with mobile sinks in massive sensor networks

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
A family of simple distributed minimum connected dominating set-based topology construction algorithms

Journal of Network and Computer Applications
MobiRoute: routing towards a mobile sink for improving lifetime in sensor networks

DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Review: A1: An energy efficient topology control algorithm for connected area coverage in wireless sensor networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose the minimum Wiener index spanning tree (MWST) as a routing topology that is suitable for sensor networks with multiple mobile base nodes. However, it was proved that finding a spanning tree with the minimum Wiener index from a weighted graph is NP-hard. To address this problem and analyze the effectiveness of the MWST as the routing tree on sensor networks with multiple mobile base nodes, we designed two algorithms: a branch and bound algorithm for small-scale wireless sensor networks and a simulated annealing algorithm for large-scale wireless sensor networks. The simulation results show that MWST outperforms the minimum spanning tree (MST), one of the representative spanning trees used in many routing protocols for sensor networks, in terms of energy efficiency and packet delay.