Research On LEACH-based Routing Protocol Of Wireless Sensor Networks

Wireless sensor networks have the features of large quantity of nodes, wide distribution, limited energy. Therefore, efficient routing protocol for wireless sensor networks can save the energy of a single node and extend the life cycle of the entire network, so it has a great significance on the application widespread of the new networks. As a kind of typical wireless sensor network routing protocol, LEACH protocol has the advantage of hierarchical routing, but it still has deficiency in the cluster head election and cluster heads routing way. To solve this problem, based on LEACH protocol, the routing algorithm is improved to reduce the routing energy consumption in this paper.REAN algorithm is used in the cluster head election process. During the competition of cluster heads, this algorithm can correct node residual energy, integrate node neighbor information, and select a more rational cluster head. Simulation results show that the improved algorithm can make the first node dead time extend 25.7% compared with LEACH. Moreover, the algorithm can be flexibly adjusted depending on the application. In the routing process between cluster head, EASM algorithm is used in this paper, making the cluster head nodes choose the single-hop routing or multi-hop routing dynamically, saving the energy and maintaining the network equilibrium. Simulation results show that the improved algorithm can make the dead time of half of the nodes extend 12% compared with LEACH. At the same time, the improved algorithm can avoid the hot spot phenomenon in the networks.