基于双通信半径的DV-Hop改进算法  

DV-Hop Modified Algorithm based on Double Communication Radius

作　　者：赵建平[1] 马淑丽[1] 

机构地区：[1]曲阜师范大学物理工程学院,山东曲阜273165

出　　处：《通信技术》2015年第12期1406-1410,共5页Communications Technology

基　　金：国家自然科学基金资助项目(No.11302118);山东省自然科学基金资助项目(No.ZR2014FM011);山东省高等学校科技计划项目资助(No.J12LN08)~~

摘　　要：节点定位技术是无线传感器网络的关键技术之一。基于双通信半径的DV-Hop定位算法虽然比DV-Hop算法大大提高了定位精度,但是还可以进一步改进。在双通信半径定位算法基础上,用最佳指数值概念改进锚节点计算平均每一跳距离的公式。将平均每跳距离进行加权处理,未知节点选择校正值时,用所有锚节点与未知节点距离的远近影响未知节点的校正值。MATALB仿真实验证明,提出的基于双通信半径的最佳指数加权DV-Hop算法能提高基于双通信半径算法的定位精度。改进的算法不会增加节点的硬件成本。Node localization technology is one of the key technologies in wireless sensor networks. DV-Hop localization algorithm based on double communication radius, although has considerable improvement on the positioning accuracy considerably as compared with DV-Hop algorithm, also could be further modi- fied. Based on dual communication radius location algorithm, the formula for calculating the average jump distance of the anchor nodes is improved with the optimal index value concept. When the average hop dis- tance is weighted by the unknown node selection correction, the corrected value of the unknown node could be affected by the distance of between the anchor node and the unknown node. MATALB simulation exper- iments show that the proposed optimal index weighted DV-Hop algorithm based on double communication radius could improve the positioning precision without any increase in hardware cost of the node.

关 键 词：无线传感器网络 节点定位 双通信半径DV—Hop 加权DV—Hop 

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