基于最小二乘优化的加权DV-Hop改进算法

摘要

As to the problem of traditional DV-Hop algorithm’s low locating accuracy, weighted DV-Hop algorithm opti-mizes average one-hop distance of unknown nodes. Based on weighted DV_Hop algorithm, a novel algorithm under the circumstance of existing GPS localization error is proposed to optimize the whole network’s average one-hop distance of beacon nodes by using least squares, and choose hyperbolic algorithm rather than trilateration to estimate the coordinates. Average localization error of a single random simulation can be reduced 13.01% than traditional DV-Hop algorithm’s, 8.94% than weighted DV-Hop algorithm’s, and results of the repeated simulations demonstrate that the improved algo-rithm has significantly better locating performance in locating accuracy and accuracy stability similarly.%针对传统DV-Hop算法定位精度差的问题，加权DV-Hop算法优化了待计算节点的平均单跳距离。在存在GPS定位误差的情况下，对加权DV-Hop算法进行了改进，利用最小二乘法优化全网信标节点的平均单跳距离，利用二次曲线算法代替三边测量法。随机单次仿真的平均定位误差较传统算法降低13.01%，较加权DV-Hop算法降低8.94%，重复实验仿真结果同样表明算法精度、稳定性有显著提高。