CAJ | 학술논문

针对DV-hop算法定位精度低的问题,本文分析了节点间的位置拓扑关系对定位精度的影响,提出了一种基于局部信标选择的定位算法(RBS-DV-hop).该算法权衡了定位精度和计算复杂度,从三方面寻找局部最优的信标节点组,包括信标节点的共线度、未知节点与信标节点的跳数以及信标节点相对于未知节点的分布.仿真结果表明,改进后的算法明显提高了定位精度和稳定性,为合理选择信标节点组进行定位提供了一种方法.
침대DV-hop산법정위정도저적문제,본문분석료절점간적위치탁복관계대정위정도적영향,제출료일충기우국부신표선택적정위산법(RBS-DV-hop).해산법권형료정위정도화계산복잡도,종삼방면심조국부최우적신표절점조,포괄신표절점적공선도、미지절점여신표절점적도수이급신표절점상대우미지절점적분포.방진결과표명,개진후적산법명현제고료정위정도화은정성,위합리선택신표절점조진행정위제공료일충방법.
After analyzing the topological relationship between nodes, this paper proposed a new localization algo-rithm (RBS-DV-hop) based on regional beacon selection to solve the problem of low localization accuracy in tradi-tional DV-hop. The beacon selection performs around the unknown node by making a tradeoff between accuracy and computational workload, the procedure includes the colinearity of beacons, the hops between unknown node and beacon, the beacon spread relative to unknown node. The experiment and simulation results show that the proposed location algorithm performs well compares with traditional DV-hop in localization accuracy and stability, and mean- while, it also provides a feasible method for selecting an optimal tern of beacons to reduce the localization error.