多通信半径DV⁃Hop定位算法的改进  

Improved DV⁃Hop Algorithm of Multiple Communication Radii

作　　者：金锋[1] 巨尔寅 JIN Feng;JU Eryin(School of Automation,Beijing Institute of Technology,Beijing 100081,China)

机构地区：[1]北京理工大学自动化学院,北京100081

出　　处：《山西师范大学学报（自然科学版）》2022年第3期52-56,共5页Journal of Shanxi Normal University(Natural Science Edition)

摘　　要：针对传统DV⁃Hop定位算法由于跳数计算存在偏差影响定位性能的问题,提出了非均等多通信半径DV⁃Hop定位算法,并做了理论推导和拓扑图分析.通过计算非均等多通信半径最佳值,计算节点间跳数,进而优化平均每跳距离,提高未知节点定位精度.仿真结果表明:半径细化程度越高,定位误差越小;在半径细化程度不大情况下,非均等多通信半径DV⁃Hop定位算法误差改进效果明显.With regard to the problem that the localization performance of DV⁃Hop algorithm is affected by the deviation of Hop calculation in traditional DV⁃Hop algorithm,an DV⁃Hop algorithm of unequal multi⁃communication radii is proposed.The proposed algorithm calculates the number of hops between nodes by calculating the optimal value of unequal multi⁃communication radii,and then optimizes the average hop distance and improves the positioning accuracy of unknown nodes.Simulation results show that the higher the degree of radii refinement,the smaller the positioning error.And the unequal multi⁃communication radii DV⁃Hop Algorithm can improve the location error significantly when the degree of radii thinning is small.

关 键 词：无线传感器网络 DV⁃Hop定位算法 非均等多通信半径 

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