Research On Path Planning Of Halin Fan Contraction Moving Node Based On Regular Hexagonal Grid Division

In order to satisfy the needs of large-scale and real-time sensing of large data in wireless sensor networks,energy saving optimization algorithm is still the top priority of WSN research.However,more and more sensor nodes are often deployed in abominable environment and inaccessible places.It is difficult to move and replace batteries.A large number of redundant nodes have seriously caused the energy waste of nodes and shortened the life cycle of the network.How to use the limited node energy to maximize the energy efficiency of the network and prolong the lifetime of the network is a common concern of the industry and academia.At present,a lot of research is based on cluster head data fusion to reduce redundant data and reduce energy consumption,but it does not reduce the repeated data acquisition in node data acquisition,resulting in a lot of unnecessary energy waste.On the basis of a large number of research and analysis of network survival time and WSN node coverage optimization algorithm,this paper divides the regular hexagonal grid into the monitoring network area.Under the premise of ensuring the monitoring task of the target area,the purpose of reducing the energy consumption is to realize the purpose of using fewer nodes and minimizing the overlapped coverage area of the network.The main contents of this paper include the following two aspects:(1)through the research and analysis of clustering optimization algorithm,an improved hexagonal mesh partitioning algorithm is proposed(HGUC).First,the sensor region is divided into hexagonal grid.The mesh size depends on the network size and the node sensing radius.Secondly,the energy consumption of all nodes is balanced from the global point of view.The maximum energy nodes are selected as the candidate cluster nodes in each region,while the residual energy,node density and the most important nodes are considered.The final cluster head nodes are determined by the number of clusters.Compared with clustering LEACH and EEUC algorithm,simulation experiments show that the algorithm can effectively balance the energy consumption of network nodes and improve the network lifetime.(2)on the basis of grid division,with the help of Halin graph fan contraction theory in graph theory,the WSN mobile node path planning algorithm(HALIN)for grid division is proposed,which uses mobile nodes to collect data in the sensing area and reduces the communication amount between sensor nodes.In order to reduce the time delay in data collection and transmission,the algorithm maps the final cluster point(cluster head node)into a Halin graph,and searches for the moving path of the mobile sink node through the contractile function of the Halin graph fan,that is,the shortest path traveling salesman problem.In the experiment,the GBME and RP-UGO algorithms are selected as the contrast to simulate the walking path length,the moving speed and the network size of the mobile nodes.The simulation results show that the algorithm is greatly improved in the energy saving of the network,and the network delay is greatly reduced under the conditions of certain practical application,and the network is satisfied.In real time,the preset purpose of the research is better achieved.