DV-Hop定位算法改进研究

Improvement of DV-Hop Localization Algorithm

传统DV-Hop定位算法中,在估算未知节点与锚节点的距离时,只采用距离其最近的一个锚节点的平均每跳距离,因而存在较大的定位误差.为了解决该问题,本文在传统DV-Hop算法基础上,同时考虑多个锚节点的平均每跳距离,根据每个锚节点的平均每跳距离误差以及跳数对未知节点的平均每跳距离进行加权处理,使其更接近实际值,未知节点与锚节点之间的估算距离更加准确,从而减少定位误差.仿真实验证明,在相同的网络环境下,改进算法定位精度明显高于传统DV-Hop定位算法.

In the traditional DV-Hop localization algorithm, when the unknown nodes estimate distance from the anchor nodes, they using only the average distance per hop of its recent anchor, so there is a greater positioning errors.To solve this problem, On the basis of the traditional DV-Hop algorithm, the average distance per hop of multiple anchor nodes are taken into account in this paper.The average distance per-hop of unknown nodes are weighted according to error of the average distance per hop of each anchor node and hops to bring it closer to the ac-tual value.Estimation distance between the unknown node and the anchor node is more accurate, thus positioning error reduced.Simulation results show that positioning accuracy of the improved algorithm is significantly higher than the traditional DV-Hop localization under the same network environment.