基于最小二乘优化的加权DV-Hop改进算法  

Improved weighted DV-Hop algorithm based on least squares optimization

作　　者：谭博[1] 车进[1] 张成[1] 

机构地区：[1]宁夏大学物理电气信息学院,银川750021

出　　处：《计算机工程与应用》2015年第2期82-86,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61162020)

摘　　要：针对传统DV-Hop算法定位精度差的问题,加权DV-Hop算法优化了待计算节点的平均单跳距离。在存在GPS定位误差的情况下,对加权DV-Hop算法进行了改进,利用最小二乘法优化全网信标节点的平均单跳距离,利用二次曲线算法代替三边测量法。随机单次仿真的平均定位误差较传统算法降低13.01%,较加权DV-Hop算法降低8.94%,重复实验仿真结果同样表明算法精度、稳定性有显著提高。As to the problem of traditional DV-Hop algorithm＇s low locating accuracy, weighted DV-Hop algorithm optimizes average one-hop distance of unknown nodes. Based on weighted DV_Hop algorithm, a novel algorithm under the circumstance of existing GPS localization error is proposed to optimize the whole network＇s average one-hop distance of beacon nodes by using least squares, and choose hyperbolic algorithm rather than trilateration to estimate the coordinates.Average localization error of a single random simulation can be reduced 13.01% than traditional DV-Hop algorithm＇s,8.94% than weighted DV-Hop algorithm＇s, and results of the repeated simulations demonstrate that the improved algorithm has significantly better locating performance in locating accuracy and accuracy stability similarly.

关 键 词：DV-HOP 加权 全球定位系统(GPS)定位误差 最小二乘法 二次曲线 

分 类 号：TN929.5[电子电信—通信与信息系统]