基于平均跳距估计和位置修正的DV-Hop定位算法

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

DV-Hop Localization Algorithm Based on Estimate of Average Hop Distance and Correction in Position

Conventional DV-Hop localization algorithm considers only the average hop distance estimated by the closest anchor node. so it will lead to larger error in position. In response to this problem, an improved DV-Hop localization algorithm based on estimate of average hop distance and correction in position is brought forward. When computing distances between an unknown node and all anchor nodes, it can obtain different distances taking into account the difference in distance and hops between the closest anchor node and other anchor nodes. The average hop distance estimated in this way is closer to the actual distance. In addition, it corrects the results of the initial positioning in circle. The simulation results show that the improved algorithm can improve the positioning accuracy effectively without increasing hardware consumption in nodes comparing with conventional DV-Hop algorithm. Furthermore, it is simple and needs small amount of calculation. So it is a practical program for nodes localization in wireless sensor networks.