The Analysis And Improvement Of Wireless Sensor Network Routing Algorithm Based On LEACH

Wireless sensor network(WSN)is a new technology for obtaining information.As a new generation of wireless network for communication,wireless sensor network has a broad space can be applied.The composition of the WSN is not complicated.It is composed of a large number of micro sensor nodes with wireless communication capabilities.These nodes perform monitoring,sensing,and data collecting in a self-organizing manner on their environment or monitoring objects.The data is finally transmitted to the base station and analyzed and utilized by the user.WSN is different from many features of traditional wireless networks,especially the limitations of sensor nodes in terms of energy,making existing wireless technologies inapplicable to it.Studies have shown that the vast majority of energy consumption in a node is in communication modules.Therefore,how to choose the right path to transmit data to save energy becomes very important.Therefore,more and more researchers focus their research on routing algorithms.At present,many mature routing algorithms have been proposed.This paper summarizes the characteristics of the plane,hierarchy,and location routing algorithms.After comparing the different performance parameters,the LEACH(Low Energy Adaptive Clustering Hierarchy),the most classic and the earliest hierarchical routing algorithm,is selected for research.The LEACH algorithm is the first hierarchical routing algorithm based on fully distributed and clustering proposed in WSN,which has the advantages of good adaptability and strong fault tolerance.However,this algorithm is less efficient in terms of energy and it is not suitable for large-scale networks.In view of the above drawbacks,an improved LEACH-based F-LEACH(First-death LEACH)algorithm is proposed in this paper.In order to extend the life time of the first death node,the overall network lifetime,and improve the energy consumption characteristics of the network,a four-point improvement was made to the LEACH algorithm:(1)By dividing the monitoring area equally into rings,the approximate path of multi-hop communication is limited,and the energy consumption of the data transmission from the distant cluster head is reduced to equalize the network load,while the monitoring range is expanded.(2)Calculate the optimal number of cluster heads and cluster head spacing for each region by formulas.This allows the cluster heads to be evenly distributed in all areas with the lowest energy consumption.(3)Cluster-head clustering across regions is used to save intra-cluster communication energy consumption and static clustering eliminates the cluster energy consumption.(4)A multi-hop path is established based on the distance and energy between cluster heads in each area.Select cluster heads with relatively close distances and higher energy for the next hop area to transmit data until the data is transmitted to the sink node.Finally,LEACH,LEACHMTE(LEACH Minimum Transmission Energy)and F-LEACH are simulated by MATLAB.It is proved that the F-LEACH algorithm can extend the survival time of the first dead node and the overall network lifetime,and effectively improve the network energy consumption.The characteristics eventually increase the total amount of data collected.