基于拓扑相关性的改进型DV-Hop算法  

Improved DV-Hop algorithm based on topology correlation

作　　者：张纪文[1] 柴乔林[1] 王登第[1] 

机构地区：[1]山东大学计算机科学与技术学院,山东济南250101

出　　处：《计算机工程与设计》2011年第6期1885-1888,共4页Computer Engineering and Design

摘　　要：在拓扑不规则的传感器网络中,传统的DV-Hop算法在平均跳距计算上不合理,使得节点的定位误差很大,针对这一问题,提出了一种基于拓扑相关性的改进算法。该算法的主要原理是根据网络拓扑相关性和跳数加权计算平均跳距,并对多个估算结果进行面积加权,有效地提高了定位精度。仿真结果表明,与传统DV-Hop相比,该算法在不增加额外硬件支持的前提下,更适合于随机分布网络中的节点定位。In wireless sensor networks which topology is irregular, traditional DV-Hop algorithm is unreasonable in calculating the average of hop distance, making a great error in node location. To solve this problem, an improved algorithm based on topology correlation is presented. The main principle is using topology correlation and the number of hops to weight the average of hop distance, and area-weighting various estimation results, improving the positioning accuracy effectively. Results of the simulation show that the improved algorithm without additional hardware support is more suitable for node localization in random distribution network.

关 键 词：传感器网络 定位算法 拓扑相关性 DV-HOP算法 OMNET++仿真 

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