An novel energy-efficient redundant routing tree algorithm for wireless sensor networks

  • Authors:
  • Chen Xiao-Tian;Zhang Shun-Yi;Wang Pan;Zhang Ming

  • Affiliations:
  • Information Network Research Institute, Nanjing University of Posts&Telecommunications, Nanjing, China;Information Network Research Institute, Nanjing University of Posts&Telecommunications, Nanjing, China;Information Network Research Institute, Nanjing University of Posts&Telecommunications, Nanjing, China;College of Electronic Engineering, Huaihai Institute of Technology, Lian yungang, China

  • Venue:
  • WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Nodes in wireless sensor networks(WSNs) are tiny and energy-limited, so in order to enhance the entire network lifetime, this paper puts forward a novel energy efficient redundant routing tree(EE-RRT) algorithm for wireless sensir networks. EE-RRT has three obvious features: Firstly, it improves virtual grid ideas to divide each cluster into M×N square area and select a working node in each grid to reduce redundant information and economize energy. Secondly, EE-RRT improves energy utility by changing the activity of wireless communication module of sensor nodes. energy model and state transition of sensor nodes. Last, it builds a redundant routing tree as the transmission agents to realize the information exchange between the clusters and base-station so that the energy consumption of normal nodes and clusters' heads can be decreased and reduces the dynamic clustering time to save energy. Simulation results show that, compared with LEACH and RNTA, EE-RRT significantly reduce in energy consumption and prolong the network lifetime.