The Research And Improvement Of Leach Routing Algorithm For Wireless Sensor Network

Wireless sensor network composed of sensor nodes can make the ordinary objects have the ability of perception and communication, so it can be widely used in military, environmental monitoring, civil and industrial fields. However, wireless sensors can not replace the battery due to their limited energy, and we should focus on designing an efficient routing algorithm, balancing the use of energy, and prolonging the survival time of the network in wireless sensor networks.Firstly, the current research status of wireless sensor networks is described in this paper. Some existing typical flat routing algorithms and hierarchical routing algorithms of wireless sensor networks are introduced, and the performances of several improved methods of LEACH algorithm are compared by simulation.Secondly, an improved LEACH algorithm, namely, restriction distance based multi-hop clustering (RDMC) routing algorithm is proposed for wireless sensor networks to overcome the existing problem in LEACH algorithm. For example, single hop communication is not conducive to the expansion of the network, the cluster head overload etc. In the RDMC algorithm, a restriction distance do is set forward. If the distance between the cluster head and base station is less than do, one hop communication is adopted, and if more than do, multi-hop communication is adopted. Simulation results derived on the MATLAB simulation platform show that this algorithm can effectively overcome the problem in single hop communication, the problem about cluster head and other problems. The improved algorithm is suitable for large scale networks.Then this paper analyzes the advantages and disadvantages of LEACH algorithm. An improved algorithm according to the disadvantages of LEACH algorithm is proposed. The main idea of the improved algorithm is that the effects that the energy factor and the neighbor node number of cluster head take on the selection of cluster head are taken into account and we add the two parameters into the cluster heads selection threshold formula. Based on the above scheme, an improved LEACH algorithm from another aspect is proposed. According to PEGASIS algorithms in which the cluster heads are connected in a chain, comprehensive consideration about the residual energy of the cluster head and the distance between the cluster head and base station are taken, and a chain node is selected to communicate with the base station. Simulation results derived on MATLAB simulation platform show that the improved algorithm can save networks’overall energy consumption and prolong the network life.