基于跳数修正的DV-Hop定位的改进算法  

Improved DV-Hop Positioning Algorithm Based on Modifying Hop Counts

作　　者：郑久虎[1] 钱焕延[1] 高德民[1] 严筱永[1] 

机构地区：[1]南京理工大学计算机科技与技术学院,南京210094

出　　处：《计算机科学》2013年第1期63-67,共5页Computer Science

基　　金：国防科工委应用基础资金资助

摘　　要：DV-Hop算法是一种最典型的非测距的节点定位算法。为了提高DV-Hop算法的精度,引入了前序节点(Previous Node,PN)和总平均每跳距离这两个概念,设计了改进的MHDV-Hop算法,它只需很低的信标节点比例,不改变DV-Hop算法的过程,也不需要额外硬件支持,通过PN的数量计算出未知节点到信标节点跳数的修正系数,使得定位精度有很大提高。DV-Hop algorithm is one of the most classic range-free localization algorithms in wireless sensor networks.In order to enhance the localization accuracy of the DV-Hop algorithm,this paper introduced two terms of the previous node and Total HopSize,and designed an improved MHDV-Hop algorithm.In the improved algorithm,the correction factor of unknown node to beacon node hops is calculated based on the number of PN.It not only dons＇t change the positioning process of the DV-Hop algorithm at lower ratio of beacon nodes and without additional hardware support,but also greatly improves the localization accuracy.

关 键 词：无线传感器网络 节点定位 DV-HOP 前序节点 

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