论文部分内容阅读
在由于传统DV-Hop定位算法中假定所有相邻节点之间的跳距相等,因此节点间的距离估计误差偏大,进而导致算法的定位精度偏低.为了提高节点间距离估计的准确性,提出两段式距离估计算法.该算法将锚节点与节点之间的h距离划分为两段:前h-1跳和最后一跳,并假设前h-1跳跳距相同,最后一跳的跳距与其邻居节点到锚节点的跳数有关.将两段式距离估计算法应用到DV-Hop算法上,本文还提出了改进的两段式DV-Hop算法.仿真结果表明,与传统的DV-Hop算法相比,改进算法可有效提高定位精度且无需增加节点通信开销.
Due to the assumption that the hop distances between all adjacent nodes are equal in the traditional DV-Hop localization algorithm, the estimation error of the distance between nodes is large, which leads to the low positioning accuracy of the algorithm.In order to improve the accuracy of the distance estimation between nodes, This paper proposes a two-stage distance estimation algorithm which divides the h-distance between the anchor node and the node into two parts: the first h-1 and the last one, and supposes that the first h-1 has the same hops and the last hops The hop distance is related to the hop count of its neighbor node to the anchor node.The two-segment distance estimation algorithm is applied to the DV-Hop algorithm, and an improved two-segment DV-Hop algorithm is also proposed in this paper.The simulation results show that compared with the traditional DV Compared with -Hop algorithm, the improved algorithm can effectively improve the positioning accuracy without increasing the node communication overhead.