针对不规则网络的高精度和高效率的多跳定位算法  

An Accuracy and Efficiency Multi-hop Localization for Irregular Network

作　　者：张正 柳亚男[1] 王雷 方旭明[2] ZHANG Zheng;LIU Ya’nan;WANG Lei;FANG Xuming(Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100093,China;College of Network Security,Jinling Institute of Technology,Nanjing 211169,China)

机构地区：[1]中国科学院信息工程研究所,北京100093 [2]金陵科技学院网络安全学院,南京211169

出　　处：《信息网络安全》2021年第6期11-18,共8页Netinfo Security

基　　金：国家重点研发计划[2017YFB0802800];国家自然科学基金青年基金[61902163]。

摘　　要：针对不规则网络中多跳定位性能下降的问题,文章提出了一种高精度、高效率的多跳定位算法。首先,采用高效距离估计方法,获取节点间的估计距离。然后,依据距离估计的误差推导出最优加权矩阵,在其帮助下运用双曲线估计法,消除累积误差的干扰,进而提高定位精度和稳定性。最后,通过节点间的几何关系分析,发现并纠正因锚节点分布不当造成的异常估计问题。性能与实验分析表明,文章方案定位精度高且运行开销低。Due to the low performance of multi-hop localization in the irregular networks,a novel accuracy,and efficiency multi-hop localization algorithm was proposed.First,an efficient distance estimation method was employed to estimate the distance between anchors and non-anchors.Second,an optimal weighting matrix was derived by the distance estimation error and uses the optimal weighting matrix and a hyperbolic estimation method to eliminate the influence of multi-hop cumulative error on positioning accuracy and stability.Last,the outlier estimated estimation was found by analyzing the geometric relationship between nodes and correct with Bounding-Box algorithm.Performance and experimental analysis all show that the proposed algorithm has high localization accuracy and low operating cost.

关 键 词：非测距 多跳定位 最优加权矩阵 双曲线估计 Bounding-Box算法 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]