锚节点选择和距离修正的DV-Hop定位算法  

DV-Hop Localization Algorithm on Ahchor Node and Revision of Distance

作　　者：王学[1] 李蒙[2] 宋书中[1] 

机构地区：[1]河南科技大学电子信息工程学院,河南洛阳471000 [2]洛阳理工学院计算机工程系,河南洛阳471000

出　　处：《计算机测量与控制》2012年第12期3317-3320,共4页Computer Measurement &Control

基　　金：河南省高等学校青年骨干教师资助计划(2009GGJS-122);河南省教育厅自然科学研究计划项目(2010B510016)

摘　　要：为了更好地解决DV-Hop算法定位精度较低的问题,提出一种改进DV-Hop定位算法;首先利用共线性阈值选取锚节点参与位置估计;然后对实际距离和估计距离的误差采用最小二乘法校正锚节点的平均跳距,再用加权修正距离值;考虑到未知节点到锚节点路径与锚节点间路径有重合的情况,用算术平均值计算平均跳距;最后采用二维双曲线定位算法来提高定位精度;仿真结果表明,与传统DV-Hop相比,改进算法在定位稳定性、覆盖率和定位精确度方面都得到了提高。To overcome the disadvantage of multilateral ranging method , an improved DV--Hop localization algorithm is proposed. In the improved algorithm, firstly only through the eollinearity inspection the effectiveness of beacon nodes could be verified. Secondly the average one--hop distance among beacon nodes was refined by means of least squares method and modify the average distance through weighting the N received average one--hop distances from beacon nodes. Considered the feature of coincidence or part of the overlap which existed in the path from unkown nodes to beacon nodes and the path between the beacon nodes, we use the simple method to calculate the average one --hop distance. At last use the 2--D Hyperbolic location algorithm to improve the localization accuracy effectively. The simulation results show that the improved algorithm can increase location stability , location precision and coverage rate effectively with conventional DV--Hop algorithm.

关 键 词：平均跳距 加权 共线性阈值 双曲线定位法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]