基于区域划分的DV-Hop定位算法的改进  

Regional division based improvement for DV-Hop localization algorithm

作　　者：夏少波[1] 连丽君[1] 邹建梅[1] 朱晓丽[1] 

机构地区：[1]山东广播电视大学计算机与通信学院,山东济南250014

出　　处：《山东科学》2015年第3期110-116,共7页Shandong Science

基　　金：山东省自然科学基金(ZR2012FM033)

摘　　要：DV-Hop节点定位算法采用跳数乘以每跳平均跳距估算节点间的距离,而跳数和每跳平均跳距受网络的节点密度、节点的通信半径等参数影响较大。针对DV-Hop算法存在的不足,提出一种基于跳数区域划分的DV-Hop定位改进算法——HRDV-Hop(Hop regional division DV-Hop,HRDV-Hop)。对一跳区域的节点测距引入RSSI技术,两跳或以上区域的节点采用跳数值修正法,再辅以限制跳数机制。MATLAB仿真测试结果表明,在相同的网络硬件和拓扑环境下,改进后的算法能更有效地降低节点间的距离估算误差,提高定位精度。DV-Hop node localization algorithm employs hop count multiplied by average per hop distance to estimate the distance between two nodes. However, hop count and average per hop distance are closely related to node density and communication radius. We present a regional division based DV-Hop localization improved algorithm, HRDV-Hop （ Hop Regional division DV-Hop, HRDV-Hop） for the negative of traditional DV-Hop algorithm. We use RSSI algorithm for one- hop node, hop count correction method and limitation mechanism for two or more hop nodes. MATLAB simulation results show that the improved algorithm can effectively reduce distance estimation error between two nodes and improve localization accuracy, as compared with other algorithms in the same network hardware and topology.

关 键 词：无线传感器网络 定位 节点定位 理论跳数 跳数区域 

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