Research On Energy Efficient Routing Algorithm In Wireless Sensor Networks Based On Improved LEACH

With the development of Sensor,Wireless Communication,Microelectronics and Embedded technology,as well as the growing demand for information acquisition,Wireless Sensor Network(WSN),as a new information acquisition technology with multiple technologies intersecting,has rapidly become the focus of research in recent years and has been widely used in various fields.WSN has a networking flexible,economical and practical,small size and easy deployment,and many other advantages,but due to the computing power and storage nodes energy is limited,and deployment environments,complicated,difficult to supplement energy,not easy recycling,etc,so has higher request to the network of energy saving,WSN routing algorithm as the improved the key technology of network energy consumption,caused the high attention of researchers both at home and abroad.LEACH(Low Energy Adaptive Clustering Hierarchy)algorithm,as the most classical routing algorithm,has some shortcomings,but its proposed hierarchical structure and cyclic wheel mechanism have great reference value.Based on the research summary of WSN and its routing algorithm,this thesis makes an in-depth analysis of the energy consumption of sensor nodes on the basis of LEACH routing algorithm,and makes improvements on problems such as energy consumption optimization and premature death of nodes.The main contents of this thesis are as follows:(1)This thesis first systematically discusses the composition structure,key technologies,characteristics and applications of WSN,summarizes the characteristics and main research ideas of WSN routing algorithm,expounds the classification method of WSN routing algorithm and mainstream routing algorithm,and focuses on the analysis of LEACH algorithm,which lays a theoretical foundation for this research.(2)According to the WSN energy consumption model,the energy consumption of remote cluster head data forwarding,node sending,node clustering and the relationship between network energy consumption and cluster head location are studied and analyzed in depth.Based on the analysis results,a Wireless Sensor Network Routing Algorithm based on Block Clustering and Springboard Nodes(BCSN)is proposed.In order to reduce the energy consumption of nodes clustering,a hybrid communication mode is adopted,that is,the near regional nodes communicate directly with the sink node and the remote regional nodes cluster forward communication.The transmission energy consumption of nodes is controlled by block partition.To improve the selection of cluster head nodes and reduce network energy consumption;Introducing springboard node to reduce energy consumption of remote cluster head data forwarding.The simulation results show that the BCSN algorithm can effectively reduce the network energy consumption,prolong the network life,improve the network energy utilization rate,and significantly improve the network energy saving.(3)The energy consumption of cluster head nodes and the network time delay are analyzed,and the factors leading to the premature death of nodes and affecting the network time delay are summarized,and the estimation formula of the network time delay is given.On this basis,a routing algorithm of WSN based on uniform partition is proposed to solve the problem of premature death of nodes and considering the energy saving and time delay of the network.The optimal partition with the smallest difference in the number of nodes was calculated through multiple tree traversal,the number of cluster head member nodes was balanced,and the network delay was reduced.The springboard node is used to forward the data of the remote cluster head to reduce the energy consumption of data forwarding of the remote cluster head and balance the forwarding load of the cluster head node,so as to further balance the communication load of the cluster head node and avoid the premature death of the node due to excessive load.The selection weight formula of cluster head nodes is improved.The location of cluster heads is optimized through the distance factor to reduce the network energy consumption.And the residual energy factor is used to avoid the premature death of nodes continuously acting as cluster heads to balance the network energy consumption.The simulation results show that the proposed algorithm effectively prolongs the life of the first energy-depleted node,avoids the premature death of the node,and improves the time delay and energy saving performance of the network.