Research On WSN Routing Protocol Based On LEACH

As an emerging network measurement and control technology, Wireless sensor network is an intelligent network application system that can independently realize data acquisition, fusion and transmission application. Wireless sensor network ties the logical information and the physical world tightly together, and really realizes "the ubiquitous" computing mode. Wireless sensor network has broad application prospect whether in the field of national defense or in the field of national economy.Wireless sensor network’s battery energy is the most precious resource of each node, and how to use energy efficiently to maximize the network life cycle and maintain a continuous supply of energy is an important principle of design. The ultimate purpose of this paper is to increase the life cycle of the network by researching on the traditional hierarchical routing protocol algorithm-LEACH. For the nodes are deployed randomly in the application area, they are vulnerable to the malicious nodes, so LEACH-P is proposed and based on probability prediction mechanism to improve the reliability of the wireless sensor network. It takes full account of the attack node in the cluster election process and calculate the captured probability of candidate cluster head node in the virtual network grid based on the given formula to decrease the elected probability of the captured node; During the cluster zoning phase, if the area of all the clusters is almost the same, the cluster head nodes away from the sink node will consume more energy than the head nodes near it, so the improved method of zoning is proposed by making the cluster area near the sink node bigger to balance the network energy consumption. When without considering the attack nodes, this paper proposed the LEACH-E algorithm to balance the network energy consumption, it improves the cluster head election threshold formula based on the remained energy and then calculate the optimal number of the cluster head based on the number of nodes in this cluster thereby to carry on the additional cluster head election process based on the energy remained and the distance factor.The paper simulates the two algorithms by using the Matlab simulation software and assess them from the aspects of the overall network energy consumption, the life cycle and the amount of data transmission. The results show that the LEACH-P algorithm can save the network energy effectively, prolong the network life cycle by almost30%, and the LEACH-E can prolong15%compared with the LEACH-P. Therefore, it can be seen that the improved algorithm can improve the original algorithm greatly and achieve the purpose to prolong the life cycle of the wireless sensor networks.