In order to solve the problem that the traditional DV-Hop location algorithm has a large error in locating unknown nodes, this paper proposes an improved DV-Hop algorithm based on dual communication radius. By adding a communication radius, the algorithm updates the minimum hop number obtained by the unknown node closer to the beacon node to a smaller hop value and keeps the minimum hop number information of unknown nodes farther away. This method reflects the gap between the actual distances in terms of hop number, which solves the problem of the large difference between the actual distances of the same hops to a certain extent. Therefore, it is more advantageous to estimate the more accurate average jump distance and can calculate the more precise distance between them and obtain the more precise coordinates of unknown nodes. MATLAB simulation results show that the improved algorithm based on dual communication radius DV-Hop can effectively reduce the location error and improve the location accuracy and stability compared with the traditional DV-Hop location algorithm.

为了解决传统DV-Hop定位算法在未知节点定位中存在较大误差的问题，提出了一种基于双通信半径的改进DV-Hop算法。通过增加通信半径，该算法将靠近信标节点的未知节点获得的最小跳数更新为较小的跳值，并使未知节点的最小跳数信息保持更远的距离。该方法以跳数反映了实际距离之间的差距，在一定程度上解决了同一跳的实际距离之间差异较大的问题。因此，估计更精确的平均跳跃距离并计算它们之间的更精确距离并获得未知节点的更精确坐标将更为有利。