DV-Hop算法中未知节点获取校正值的改进方法  

A Modified Method for Obtaining Correction Value of Unknown Nodes in DV-Hop Algorithm

作　　者：狄振强[1] 马淑丽[1] 赵建平[1] 刘凤霞[1] 

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

出　　处：《通信技术》2016年第3期329-334,共6页Communications Technology

基　　金：国家自然科学基金资助项目(No.11404185);山东省高等学校科技计划项目资助(No.J12LN08);曲阜师范大学技术开发项目(No.hxkj2015017)~~

摘　　要：无线传感器网络中,大量传感器节点随机部署。在DV-Hop定位算法中,未知节点根据校正值和与锚节点间的最小跳数值估算自身与锚节点间的距离。校正值的选择和计算方法有多种。对比多种取校正值的方法,并提出两种新的计算校正值方法。MATLAB仿真表明,各种取校正值的方法在一定的通信半径下各占优势。新的计算校正值方法在相同条件下比其他方法明显占优势。改进的DV-Hop算法比一般的DV-Hop算法、加权的DV-Hop算法、最佳指数值下DV-Hop算法定位精度分别提高2.38%、1.96%、1.31%,同时不会增加网络硬件成本。In wireless sensor networks, a large number of nodes are randomly distributed. In DV-Hop localization algorithm, the unknown nodes estimate the distance between themselves and the anchor nodes in accordance with the corrected value and the minimum hop count between the anchor nodes. There are various method for selection and calculation of the correction value. After the comparison of muhiple methods, two novel methods for calculating the correction value are proposed. MATLAB simulation indicates that various methods for obtaining correct values enjoy different advantages under a certain communication radius. The novel calculation method is clearly superior to other methods in same conditions. The positioning accuracy of modified DV-Hop algorithm iS improved by 2.38%, 1.96%, 1.31% respectively as compared with that of DV-Hop algorithm, the weighted DV-Hop algorithm, and the DV-Hop algorithm of optimal index value, without any increase of network hardware cost.

关 键 词：无线传感器网络 节点定位 加权DV-Hop算法 最小均方差 

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