基于跳数区域划分的DV-Hop改进算法

DV-Hop节点定位算法使用跳数乘以平均每跳跳距估算节点间的距离,而平均每跳跳距的估算精确度与网络的拓扑结构、节点密度、节点通信半径等参数都有关系。针对DV-Hop算法过程存在的不足,为减少定位误差,本文提出了一种基于跳数区域划分的DV-Hop改进算法,引入了RSSI测距技术和限跳机制,优化参与定位的信标节点组合,采用多次三边测量法,最后用质心法确定未知节点坐标。MATLAB仿真测试表明,在相同的检测环境下,改进后的算法与其他改进算法相比,能更有效地降低定位误差,提高定位精度。

Improved DV-Hop Algorithm Based on Regional Division of Hop Count

DV-Hop node localization algorithm uses the hop count multiplied by the average per hop distance to estimate the distance between nodes. The accuracy of estimation is related to the topology of the network, the node density and the node communication radius parameters. Aiming at the defect existing in DV-Hop algorithm process, and in order to reduce the positioning error as well, this paper puts forward the improved DV-hop algorithm based on regional division of hop count. The RSSI location technology and the hop-limitation mechanism was introduced, the combination of the beacon nodes optimized, the three-sided measurement adopted several times, and finally, the centroid method used to determine the coordinates of the unknown nodes. The Matlab simulation tests show that this improved algorithm, compared with other algorithms, can effectively reduce the positioning error and improve the positioning accuracy in the same environment.