The Research And Improvement Of DV-Hop Localization Algorithm In Wireless Sensor Networks

The DV-Hop algorithm is a kind of non-distance localization algorithm based on the network connectivity that can calculate nodes coordinates.It can greatly reduce the hardware facilities.Therefore,The algorithm is widely used in some of the general requirements of the accuracy of the occasion and well received by researchers.However,the traditional algorithm can improve the positioning accuracy in the random topology network environment.After surveying a large number of relevant literature,we found that most of the improved algorithms are improved from the following two aspects: To improve the estimation accuracy of the average hop distance in the second phase of the localization algorithm and the method of estimating the unknown node coordinates in the third phase of the localization algorithm.The main content of this paper is how to effectively improve the positioning accuracy of DV-Hop algorithm,including the following points:(1)Considering the problem that the average estimation error of the average hop distance is larger in the second phase of the DV-Hop localization algorithm,a new ACDV-Hop algorithm based on pseudo error factor is proposed.Its main idea is: the new algorithm defines the pseudo error factor that named Factor.Through the pseudo error factor,it can eliminate the beacon node which has a great impact on the ranging error,and then calculates the corrected average hop distance according to the new beacon node set,so as to improve the estimation accuracy of each hop distance.(2)A new algorithm,LC-DV-Hop algorithm based on coordinate correction,based on the AC-DV-Hop algorithm is proposed to solve the problem that the coordinates of unknown nodes in the third stage are still insufficient.Its main idea is: Firstly,improving the estimation accuracy of the average hop distance value through the improved AC-DV-Hop algorithm.Then,each beacon node is assumed to be an unknown node,and the estimation error of the coordinate is calculated according to the geographic coordinates of the other beacon nodes.Finally,the product values of all the coordinates and the weights of the beacon nodes are applied to the estimation of the unknown nodes by defining the corresponding weights.And the more the number of hops from the unknown node,the greater the weight is;otherwise,the smaller the weight is.Finally,the simulation experiments are carried out on the proposed algorithm of this paper,weighted improvement algorithm of other researchers and DV-Hop algorithm.And the simulation results show that the average location error and stability of the improved algorithm proposed in this paper are better than DV-Hop and Weighted improvement DV-Hop algorithm.