基于平均跳距估计的改进DV-Hop定位算法

传统DV—Hop定位算法只考虑了最近一个锚节点估计的平均每跳距离，而单个锚节点估计的平均每跳距离值无法准确地反映网络的实际平均跳距，导致定位误差较大。针对这一问题，提出一种基于平均跳距估计的改进DV—Hop定位算法。改进算法在计算未知节点到各个锚节点距离时，考虑到离该未知节点最近的锚节点到其它锚节点的距离及跳数的不同，计算出不同的平均跳距，使其更接近于实际平均跳距。仿真结果表明，与传统DV—Hop算法相比，改进算法在不需要增加节点的硬件开销的基础上能更有效地提高定位精度，并且算法简单，计算量小，是无线传感器网络中节点定位的一种实用方案。

Improved DV-Hop localization algorithm based on estimation of average hop distance

Conventional DV-Hop localization algorithm considers only the average hop distance estimated by the closest anchor node. The average hop distance estimated by a single anchor can not reflect the actual average hop distance accurately in the network. It will lead to larger error in position. In response to this problem, an improved DV-Hop localization algorithm based on estimation of average hop distance is brought forward.When the distances between an unknown node and all anchor nodes are computed, the improved algorithm can obtain different average hop distances by taking into account the differences in distances and hops between the closest anchor node and other anchor nodes. The average bop distance estimated in this way is closer to the actual distance. The simulation results show that the improved algorithm can improve the positioning accuracy effectively without any increase in node hardware costs comparing with conventional DV-Hop algorithm. Furthermore, the algorithm is simple and needs small amount of calculation. So it is a practical program for nodes localization in wireless sensor networks.