Energy-Predicted Shortest Routing Tree Algorithm in Wireless Sensor Networks

Authors:
Ming Zhang;Chenglong Gong;Yuan Feng;Chao Liu
Affiliations:
Huaihai Institute of Technology, Lian yungang, Jiangsu, China 222005 and Nanjing University of posts & Telecommunications Nanjing, Jiangsu, China 210003;Huaihai Institute of Technology, Lian yungang, Jiangsu, China 222005;Huaihai Institute of Technology, Lian yungang, Jiangsu, China 222005;Nanjing University of posts & Telecommunications Nanjing, Jiangsu, China 210003
Venue:
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
Year:
2008

Citing 3
Cited 0

Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Prediction-based energy map for wireless sensor networks

Ad Hoc Networks
Minimum energy mobile wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor networks (WSNs) consists of unattended sensors with limited storage, energy (battery power) and computational and communication capabilities. Since battery power is the most crucial resource for sensor nodes, the energy prediction and the shortest path is special important. In this paper, we present an energy-predicted shortest routing tree algorithm (EP-SRT) for wireless sensor networks. it improves energy utility by changing the activity of wireless communication module of sensor nodes, energy prediction model and state transition of sensor nodes, while employs clustering and the principle of Prim and Djkstra to build the shortest routing tree to prolong network lifetime. Simulation results show that EP-SRT performs better than MIP and SRT algorithm with high-density deployment and high traffic.