基于邻居节点相似度的改进DV-Hop节点定位算法

Improved DV-Hop Localization Algorithm Based on Similarity of Neighbor Node

针对DV-Hop定位算法存在的定位精度较低的不足,提出了邻居节点相似度概念,克服了DV-Hop定位算法中节点间距离区分度单一的缺点,同时在多跳通信中,考虑了通信路径的情况,将DV-Hop算法直接计算折线距离代替实际中直线距离这一不足,采用余弦定理和邻近节点相似度对其进行修正。从而实现了对DV-Hop算法的改进,提高了定位精度。最后对改进后的算法和DV-Hop算法以及参考文献中的算法进行仿真比较,结果表明:改进后的算法较DV-Hop算法在节点定位精度上提高了30%以上。

In view of DV-Hop localization algorithm that in the lower positioning accuracy, the concept of similarity of neighbor node is put forward to overcome the shortcomings of a single discrimination of the distance between nodes. Apart from this, cosines and similarity of neighbor are also used to correct the lack of DV-Hop algorithm use polygonal lines instead of the actual lines in the communication of multi-hop, which improves the positioning accuracy of DV-Hop localization algorithm and mades it better. The simulation resuhs show that the improved algorithm compared with DV-Hop localiza- tion algorithm has improved the accuracy of more than 30%.