Research On The Optimization Of Hierarchical Clustering Based On Intermediate Nodes In WSN

Wireless sensor network(WSN)consists of a large number of sensor nodes distributed in the detection range.Each node cooperates with each other and transmits detected and collected data to users in a multi-hop manner.Wireless sensor network with low cost,easy deployment,flexible topology and other characteristics,by more and more widely used.However,the environment in which the wireless sensor nodes are placed is generally harsh,and the batteries are generally not rechargeable or replaceable.Therefore,it is very meaningful to study how to reduce network energy consumption and extend network lifetime to make the network work for as long as possible.In the research and application of wireless sensor network,it is found that the largest part of the network energy consumption is the communication part.As long as the energy consumed by the communication module is reduced,the energy consumption of the whole wireless sensor network can be reduced.Through the reasonable design of transmission path and routing algorithm can effectively reduce the energy consumption in the communication process.Clustering algorithm is always considered to be the most effective way to optimize network structure and reduce energy consumption.LEACH(Low Energy Adaptive Clustering Hierarchy)algorithm is one of the most classic clustering algorithms.Therefore,the LEACH algorithm is the basis for studying the clustering process.However,the classical LEACH algorithm is not suitable for the present applications because of its deficiencies in the beginning of the design,such as not suitable for large-scale networks,unbalanced energy consumption and so on.As a result,more and more improved algorithms are derived,and two of them are the P-LEACH algorithm and the EEM-LEACH algorithm.After studying these two algorithms in depth,this paper proposes its own improvement method.First of all,to build a network model,the network model in this paper is based on the ordinary clustering network,in each cluster select the intermediate nodes to form a subnet.Combined with the system model and the mathematical model of mimed integer linear programming,according to the optimization algorithm LEPSA(low energy path search algorithm)proposed in this paper,to find the best path for data transmission.Through the theoretical analysis of the algorithm and MATLAB simulation,the simulation results show that compared with the P-LEACH algorithm and the EEM-LEACH algorithm,the LEPSA algorithm can effectively reduce the network energy consumption and extend the network lifetime,and the computational complexity does not increase significantly.