基于平均跳距修正的无线传感器网络节点迭代定位算法  

Iterative algorithm for locating nodes in WSN based on modifying average hopping distances

作　　者：林金朝[1,2] 陈晓冰[1] 刘海波[1] 

机构地区：[1]重庆邮电大学无线信息与传感器网络研究中心,重庆400065 [2]重庆大学通信与测控技术研究所,重庆400044

出　　处：《通信学报》2009年第10期107-113,共7页Journal on Communications

基　　金：国家自然科学基金项目(60702055);教育部新世纪优秀人才支持计划(NCET-07-0914);重庆市科委科技攻关项目(CSTC;2008AB2023)~~

摘　　要：针对无需测距DV-Hop定位算法存在较大定位误差的问题,从3个方面对其进行了改进:采用最小二乘法准则校正了信标节点间的平均每跳距离;基于对多信标节点平均每跳距离的加权处理修正了用于位置估计的平均每跳距离;通过设定定位精度门限,给出了对估计的定位节点坐标进行迭代求精的数值方法。给出了改进定位算法的实现流程,并对算法的性能进行了仿真研究。仿真结果表明,在适当增加节点计算量和通信开销的条件下,改进算法的定位精度和精度稳定性有明显改善,是一种可行的无线传感器网络节点定位的解决方案。Three approaches were put forward to improve the poor locating performance of DV-Hop algorithm which is one of the range-free algorithms in wireless sensor network （WSN） with a dynamic topology. Firstly, the average one-hop distance among beacon nodes was refined by means of least squares method （LSM）. Secondly, the average one-hop distance used by each locating node for estimating itself location was modified through weighting the N received average one-hop distances from beacon nodes. Finally, the iterative numerical method with the initial values of estimated node locations was presented by setting proper threshold. The procedure of the iterative locating algorithm based on modifying average hopping distances and the simulation results were also shown. It can be concluded that the improved algorithm has obviously better locating performance in locating precision and precision stability at the cost of increasing appropriate communication and computation overhead, and is a more feasible locating scheme in WSN with both random distributing nodes and dynamic topology.

关 键 词：无线传感器网络 定位算法 平均跳距 定位性能 

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