CAJ | 학술논문

为了提高无需测距的距离矢量(DV-Hop)定位算法对随机分布网络节点的定位精度。在分析了 DV-Hop 算法实现思想的基础上，提出了一种锚节点整体均匀分布优化方案，对该算法节点跳数进行优化。另一方面，在双通信半径算法基础上提出了一种三通信半径改进方法，使得两节点之间的跳数与距离的关系更接近线性规律，最后结合两种改进方法，进行整体仿真。仿真结果表明，锚节点均匀分布的三通信半径 DV-Hop 算法比双通信半径 DV-Hop 算法提高定位精度约为7%~8%。
위료제고무수측거적거리시량(DV-Hop)정위산법대수궤분포망락절점적정위정도。재분석료 DV-Hop 산법실현사상적기출상，제출료일충묘절점정체균균분포우화방안，대해산법절점도수진행우화。령일방면，재쌍통신반경산법기출상제출료일충삼통신반경개진방법，사득량절점지간적도수여거리적관계경접근선성규률，최후결합량충개진방법，진행정체방진。방진결과표명，묘절점균균분포적삼통신반경 DV-Hop 산법비쌍통신반경 DV-Hop 산법제고정위정도약위7%~8%。
In order to increase the accuracy of distance vector (DV-Hop) localization algorithm for random distribution node positioning, based on the analysis of the DV-Hop algorithm, a uniform distribution of an-chor nodes to optimize the overall scheme of the algorithm to optimize the number of hops is proposed. On the other hand, based on the dual communication radius algorithm, this paper presents an improved triple communication radius methods, making the relationship of the number of hops and the distance between two nodes closer to a linear law, and do simulation combine two methods. Simulation results show that the positioning accuracy of the anchor nodes uniformly distributed triple communication radius DV-Hop algo-rithm versus double communication radius DV-Hop algorithm improves about 7% to 8% .