DV-Hop算法定位误差和覆盖率的改进

通过分析免测距的DV-Hop算法在定位精度及覆盖率方面的不足，提出一种改进的DV-Hop定位算法。规定只有在限定跳数内的信标节点信息才能被未知节点接收，并只有通过共线性检查证明信标节点的有效性，且有效信标节点数大于等于3时才能参与定位，分别用最小均方误差准则、归一化加权和总体最小二乘法(TLS)进行定位，然后升级已定位出的未知节点为信标节点，与最初的信标节点共同来定位其他未知节点。仿真结果表明相对于传统算法及现有的一种改进算法，本改进算法的定位精度和覆盖率有明显提高。

Improvement on location error and coverage rate in DV-Hop algorithm

An improved DV-Hop localization algorithm was proposed by analyzing the deficiencies of rang-free DV-Hop algorithm in terms of localization accuracy and coverage rate. It has been set that the beacon nodes information only within a limited number of hops could be received by the unknown nodes, and only through the collinearity inspection the effectiveness of beacon nodes could be verified, and the nodes with a number of three or more can take part in locating. The minimum mean square error criteria, normalized weighting and Total Least Squares (TLS) methods were used to locate the unknown nodes respectively. Then the located unknown nodes were upgraded to beacon nodes, with the initial positioning beacon nodes to locate other unknown nodes. The simulation results show that compared with the original algorithm and the existing improved algorithm, this improved algorithm has significantly improved the localization accuracy and the coverage rate.