Dv-Hop Node Location Algorithm Based On LM Optimization And Improved Recursion

The wireless sensor network has been widely used,and one of the key technologies it involves is node location technology.WSN is composed of many miniature sensors,and its important purpose is to collect the information of the monitored area,and then transmit it to the monitor.The node needs to rely on its own perception function to complete this operation when collecting data.However,if the specific location of the data cannot be obtained during the process of collecting information,the monitoring range will become an area that cannot be collected and cannot be controlled,which will also make WSN Lose value.Therefore,WSN requires relatively high accuracy for the location of the event.This article focuses on the Dv-Hop algorithm,a non-distance positioning algorithm in WSN,and analyzes the defects in the positioning process,and adopts certain improvement strategies to make the algorithm more universal.This paper mainly focuses on the selection of positioning algorithm,the sparse degree of network nodes and insufficient energy supply,etc.,to further improve and correct the errors in the positioning process.The main purpose is to improve the positioning accuracy of the nodes.The main work is as follows:(1)In the process of node positioning,a certain error will be generated when calculating the number of hops and the distance between nodes,and the average hop distance during the Dv-Hop positioning algorithm is corrected by using the LM algorithm.The main process is to use the LM optimization method to correct the error in the calculation of the average hop distance of the WSN global beacon node to obtain the corrected and optimized average hop distance;then set the hop threshold between the unknown node and the beacon node,and calculate The true average hop distance under the minimum mean square error criterion is combined with the average hop distance obtained before,and the average hop distance is calculated in a local range,thereby reducing the positioning error.Simulation experiments show that the improved algorithm can reduce errors in the positioning process and achieve more accurate positioning.(2)In the process of node positioning,there will be a certain error in calculating the average hop distance.When positioning unknown node coordinates,the beacon node will have insufficient energy.The recursive positioning algorithm is used to improve the Dv-Hop positioning algorithm.The algorithm first squares the distance between beacon nodes and adds the forgetting factor to the calculation of the average distance between nodes;then in the process of locating unknown nodes,it uses a recursive algorithm to replace beacon nodes with insufficient energy to make unknown nodes Able to continue the process of locating unknown nodes.Simulation experiments show that the improved algorithm can reduce errors in the positioning process and achieve more accurate positioning.In this paper,the shortcomings of the traditional Dv-Hop positioning algorithm are corrected and improved through improvement strategies such as LM optimization,average hop correction and beacon node replacement.At the same time,through simulation experiments,the research is superior to the original algorithm and comparison algorithm from the node communication radius,the total number of nodes and the ratio of beacon nodes.On this basis,the improved algorithm proposed in this paper can improve the positioning accuracy to a certain extent.