Dv-Hop Algorithm For Hierarchical Processing Of Average Hop Distance In Uwsn

Aiming at the problem in the DV-hop localization algorithm that there is a large error in the process of unknown nodes to obtain the average hop distance from the beacon node. In this paper, we analyze the influence factors of the node communication radius on the average hop distance, proposed a DV-hop algorithm Based on Hierarchical Processing of average hop distance. By studying the relationship between the average hop distance and the communication radius, the unknown nodes that are one hop away from the beacon node are divided by layers so that the unknown nodes of different levels can obtain the average hop distance with relatively small error. In the stage of estimating the position of the unknown node, the algorithm calculates the unknown node coordinates by using the maximum likelihood estimation method based on the lognormal distribution through the statistical analysis of node localization error. Simulation results show that the proposed algorithm can significantly improve the positioning accuracy in the case of large communication radius.