基于跳距修正的WSN拟牛顿迭代定位算法

Modifying Average Hopping Distances Based Iterative Algorithm for Quasi- Newton in WSN

针对DV-Hop算法在节点随机分布的网络拓扑环境下存在误差较大的问题,提出了一种基于跳距修正的WSN拟牛顿迭代定位算法(CNDV-Hop)。在详细分析DV-Hop算法过程与误差原因的基础上,提出相应改进:首先设定跳数阈值,对锚节点进行优选;然后采用新的方法校正锚节点跳距,利用对应锚节点跳距的校正值计算节点间的距离;最后用拟牛顿法对未知节点坐标的最小二乘解进行迭代优化。仿真结果表明,本文改进算法能有效地降低估计误差对定位准确度的影响,与现有改进DV-Hop算法相比精度更高。

This paper provided with one modifying average hopping distances based iterative algorithm for quasi-newton in WSN. It put forward improvement based on analysis DV-Hop algorithm progress and source of error：firstly,setting hop threshold, then optimizing anchor nodes;secondly, revising nodes hopping distance with new method and calculating distance between nodes by utilizing adjusted value of the corresponding anchor nodes hopping distances;finally, iterative optimizing least square solution of unknown node coordinates by quasi-newton method. Simulation result shows that the improved algorithm presented in this paper can effectively reduce the influence which evaluated error on location accuracy,and this algorithm is better than the existing improved DV-hop algorithm in precision.