一种无需测距节点定位算法的分析和改进  

Analysis and Improvement for a Range-Free Localization Algorithm

作　　者：赵清华[1] 刘少飞[1] 张朝霞[2] 张玮[3] 王华奎[1] 

机构地区：[1]太原理工大学信息工程学院,太原030024 [2]太原理工大学理学院,太原030024 [3]太原理工大学化学化工学院,太原030024

出　　处：《传感技术学报》2010年第1期122-127,共6页Chinese Journal of Sensors and Actuators

摘　　要：针对传统DV-Hop算法定位精度较低的缺点,提出一种改进的DV-Hop定位算法。改进算法在计算未知节点到各个锚节点距离时,根据不同的节点分布情况计算出不同的平均跳距,使其更接近于实际平均跳距,为了减小算法的计算量,定位时用Min-Max(最小最大)方法代替了最小二乘法,另外,改进算法还增加了对初步定位结果的循环位置修正。仿真结果表明,与传统DV-Hop算法相比,改进算法在不需要增加节点的硬件开销的基础上能更有效地提高定位精度,是无线传感器网络中节点定位的一种实用方案。For low positioning accuracy in Conventional DV-Hop localization algorithm,an improved DV-Hop localization algorithm is brought forward.When computing distances between an unknown node and all anchor nodes,it can obtain different distances taking into account different circumstances in nodes distribution.The average hop distance estimated is closer to the actual distance.In order to reduce the compution of algorithm,least square method is replaced by Min-Max.In addition,it corrects the results of the initial positioning in circle.The simulation results show that the improved algorithm can improve the positioning accuracy effectively without increasing hardware consumption in nodes comparing with conventional DV-Hop algorithm.So it is a practical program for nodes localization in wireless sensor networks.

关 键 词：无线传感器网络 DV-HOP定位算法 平均跳距 Min-Max(最小最大) 位置修正 

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