改进的三次修正DV-Hop定位算法  

Improved Three-time Correction DV-Hop Positioning Algorithm

作　　者：张晶[1,2,3,4] 李煜 ZHANG Jing;LI Yu(Faculty of Information Engineering and Automation,Kunming University of Science and Technology,Kunming 650500,China;Yunnan Xiaorun Technology Service Co.,Ltd.,Kunming 650500,China;Yunnan Key Laboratory of Artificial Intelligence,Kunming University of Science and Technology,Kunming 650500,China;Key Laboratory of Computer Technology Application of Yunnan Province,Kunming University of Science and Technology,Kunming 650500,China)

机构地区：[1]昆明理工大学信息工程与自动化学院,昆明650500 [2]云南枭润科技服务有限公司,昆明650500 [3]昆明理工大学云南省人工智能重点实验室,昆明650500 [4]昆明理工大学云南省计算机技术应用重点实验室,昆明650500

出　　处：《小型微型计算机系统》2022年第8期1762-1768,共7页Journal of Chinese Computer Systems

基　　金：云南省基础研究计划重点项目(202101AS070016)资助;2020年云南省研究生优质课程“算法分析与设计”建设项目(109920210048)资助;云南省“万人计划”产业技术领军人才项目(云发改人事[2019]1096号)资助;云南省技术创新人才项目(2019HB113)资助.

摘　　要：DV-Hop定位算法是一种定位误差较大的无需距离算法,而各改进算法仍存在较大误差,对此提出一种对未知节点位置进行3次修正的定位算法,该算法根据原始算法定位的缺点与特点,首先根据RSSI测距的理念,来对跳数进行连续性划分,其次提出一种平方误差适应度函数的策略,再对各锚节点在跳距适应度函数的计算中加入跳数-距离匹配因子对适应度函数进行加权,以获得更准确的跳距值,随后使用优化的跳数、跳距定位锚节点和未知节点,未知节点根据周边锚节点的偏差值采用新的锚节点反馈策略进行坐标的第1次修正,在该修正坐标处使用泰勒展开式进行展开寻优,得到未知节点坐标的第2次修正值,最后加入场景性限制条件,将不符合实际的坐标值进行修正得到未知节点的第3次修正坐标值,经实验证明,该算法在3种测试条件下均具有十分优越的定位性能.The DV-Hop positioning algorithm is a distance-free algorithm with large positioning errors,and each improved algorithm still has a large error.This article proposes a three-time correction of the unknown node location.This algorithm is in the light of the shortcomings and peculiarity of the primordial algorithm.First,according to the concept of RSSI ranging,the continuity of the number of hops is divided,and then a strategy of square error fitness function is proposed,and then the hop-distance matching factor is added to the calculation of the hop distance fitness function for each anchor node to weight the fitness function to obtain a more accurate hop distance value.and then the optimized hop number and hop distance are used to locate anchor nodes and unknown nodes.The unknown node adopts a new anchor node feedback strategy to correct the coordinates for the first time according to the deviation value of the surrounding anchor nodes.In the fixed coordinates using Taylor expansion optimization,get the unknown node coordinate of the second revised,the scene restriction conditions are added at the end,and the coordinate value that does not meet the actual value is corrected to obtain the third correction coordinate value of the unknown node.Experiments have proved that the algorithm in this paper has excellent positioning capability under the three test conditions.

关 键 词：跳距优化 锚节点反馈 泰勒中值定理 三次修正 

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