The Research On Clustering Routing Algorithm In Wireless Sensor Network

Being promising in the field of military application, industrial control and environmental monitoring and so on,Wireless Sensor Network has been recognized as one of the most influential technology in 21 century. Generally, nodes of WSN has such characteristics as restricted energy,limited resources of hardware,large scales of nodes of WSN and self-organizing dynamic network.Thus, it has become a hot issue to design a highly efficient and energy-saving WSN routing algorithm to prolong lifetime of network.This paper attempts to investigate clustering routing algorithm of WSN,and the main points are as follows:(1)Firstly, in the article the concept,architecture,character and many exciting applications of Wireless Sensor Network are overviewed and the background and significance are formulated.Some typical clustering routing protocols at present are analysed and their performances are compared.(2)On the basis of routing protocol-low energy adaptive clustering hierarchy (LEACH),a noval cluster head selection algorithm is proposed.It adjusts the values of random number according to the sensor nodes with their residuary energy and parameter c, so that the probability of node having more residuary energy, turning into a cluster head increases.The simulation results show that the improving algorithm exceeds LEACH protocol in prolonging network lifetime.(3) On the basis of the previous research,a new clustering algorithm based on energy and distance is proposed.The first layer cluster heads are selected by residual energy of node,and the second layer cluster heads are selected by energy of node and distance between cluster heads and base station,and moreover the mode of data relay is improved.Simulation results show that compared with LEACH,the algorithm can improve the load balance of the network and lengthen the lifetime of the network significantly.