基于DV-Hop的节点定位算法改进研究  

Research on improvement of node location algorithm based on DV-Hop

作　　者：张万礼[1] 宋启祥[1] ZHANG Wanli;SONG Qixiang(College of information engineering,Suzhou University,Suzhou Anhui 234000)

机构地区：[1]宿州学院信息工程学院,安徽宿州234000

出　　处：《宁夏师范学院学报》2020年第7期53-57,共5页Journal of Ningxia Normal University

基　　金：安徽省宿州市科技攻关项目(SZ2018GG01);宿州学院第三批学术技术带头人后备人选(2018XJHB07);宿州学院优秀学术技术骨干(2016XJGG12);安徽省大规模在线开放课程(MOOC)示范项目(2019mooc318,2019mooc300);宿州学院专业带头人(2019XJZY22);协同育人项目(201902167019);协同育人项目(201902167037).

摘　　要：为了解决不规则网络拓扑环境中DV-Hop算法存在较大误差的问题,提出了一种改进的DV-Hop定位算法.该算法对跳数为1的锚节点利用多通信半径的方法将跳数修正;然后通过归一化加权因子修正锚节点平均每跳距离;最后对总体最小二乘法计算得到的未知节点坐标位置利用三角形质心进一步进行修正,实现DV-Hop定位算法的全面改进,提高节点在不规则网络中定位的精确度.仿真实验证明了改进算法的有效性.In order to solve the problem of large error in DV-Hop algorithm in irregular network topology environment,an improved DV-Hop algorithm is proposed in this paper.In the improved algorithm,the number of hops of anchor nodes with 1 hop is modified by the method of multi-communication radius;then the average distance of each hop of anchor nodes is modified by the normalized weighting factor;finally,the coordinate position of unknown nodes calculated by the total least square method is further modified by the triangle centroid to realize the overall improvement of DV-Hop positioning algorithm and improve the positioning of nodes in irregular networks accuracy.Simulation results show the effectiveness of the improved algorithm.

关 键 词：DV-HOP算法 平均每跳距离 归一化加权因子 

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