Wireless sensor networks hierarchical routing algorithm based on node's energy balance

Using routing algorithm to reduce nodes' energy consumption and prolong the networks' lifetime is one of research emphasis for Wireless Sensor Networks. Based on vegetable shed, a wireless network is building and a hierarchical routing algorithm is proposed by nodes' geographical information and communication layer information. Firstly, the different layer is divided by nodes' communication layer information; Secondly, the different zone is divided by nodes' geographical information; At last, the different hierarchical static-clustering is achieved. A hierarchical routing algorithm base on static-clustering in the communication layer and node's residual energy is proposed. This paper discusses the energy efficient hierarchical routing algorithm for wireless sensor networks. In order to achieve the node's energy consumption balance, a different number's auxiliary nodes are joined in the different layer. Simulation results show that the routing algorithm effectively reduces the energy consumption of clustering and cluster-head choosing and extended the lifetime of the entire network.