Research And Improvement Of Dv-Hop Location Algorithms In Wireless Sensor Networks

With the rapid development of hardware technologies such as integrated circuits and micromotor system technology,Sensor technology has also made great progress,Making wireless sensor network technology gradually penetrate into people's daily lives.Such as smart home,traffic control,agricultural production and other fields.When and where happened,it is an important prerequisite for people to understand the event.The same is true for wireless sensor networks.Positioning information often plays a key role in monitoring data,Positioning information often plays a key role in monitoring data,Only the location of the data collection is determined,Processing data for location information.In the wireless sensor network Range-Free positioning algorithm,DV-Hop algorithm as one of the representative algorithms,Wide range of applications,Easier to expand and less restricted conditions,Can meet the positioning requirements required by the relevant application scenarios.So got a wide range of applications and research.However,the sensor node topology randomly scattered in the network is often irregular.The sparseness of nodes in the area is also different.This causes the estimated hop count information and the average hop distance to produce a certain error.Aim at the shortcomings in the DV-Hop algorithm,This article will focus on hop and hop information optimization,Improve the positioning effect of the algorithm,The work and main contents of this article are as follows:The related theories,key technologies and performance evaluation indicators of positioning technology are discussed in detail,focusing on the research results of DV-Hop algorithm and related researchers.Aiming at the localization accuracy problem caused by the accumulation of hop distance estimation error in DV-Hop algorithm,an improved DV-Hop algorithm based on global hop count optimization and hop distance error correction is proposed.Firstly,the algorithm optimized the global hop value by using the communication radius of the node and the related parameters affecting the node hop count,so that the hop count between the nodes tended to be reasonable.Then,the average hop distance was calculated according to the minimum mean square error criterion of the optimal exponent,and the average hop distance was corrected with the single hop average error,which could further reduce the error of the hop distance.The experimental results that the algorithm can effectively reduce the influence of error accumulation and improve the localization accuracy of unknown nodes,compared with DV-Hop algorithm and related literature,the algorithm has better localization effect.In order to reduce the cumulative error of the hop,Improve the positioning effect of DV-Hop positioning algorithm,An improved DV-Hop algorithm based on error weighting and ideal hopping is proposed.The algorithm first defines the average hop distance in the ideal state.Set the ideal difference coefficient,Optimize the average hop distance of the node,Then optimize the average hop distance again by weight summation,Make the average hop distance reasonable,Thereby improving positioning accuracy.Comparison by experiment,The algorithm can effectively improve the accumulation of hop error,Compared with the DV-Hop algorithm,it has better positioning accuracy.