Improvement on DV-Hop localization algorithm in wireless sensor networks

DV-Hop localization algorithm uses the hop count multiplied by the average distance per hop to estimate the distance between nodes. Under the condition of not changing the step of the original DV-Hop algorithm and not needing an additional hardware,the traditional DV-Hop algorithm was improved from two aspects to solve the problem of the large error in the localization. On the one hand,the hop count between the nodes based on the communication radius was corrected. On the other hand,with the help of the deviation between the actual distance and the estimated distance of the beacon nodes,the average hop distance per hop was corrected. In the same network environment,the positioning error of the proposed algorithm was effectively reduced by about 15% compared with the original DV-Hop algorithm,as well as reduced by 5%- 7%compared with another improved algorithm which also used the ideal estimated hop count value between the beacon nodes to correct the actual value between them. The experimental results show that the proposed algorithm can effectively reduce the distance estimation error between nodes and improve the positioning accuracy.