检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆理工大学电子信息与自动化学院,重庆400054
出 处:《通信技术》2013年第9期58-60,共3页Communications Technology
摘 要:针对DV-Hop定位算法中在计算未知节点到锚节点距离时产生较大误差的问题,提出了一种改进的DV-Hop算法。改进算法对全网平均每跳距离和局部平均每跳距离进行了加权处理,得到了未知节点的平均每跳距离,又提出了一种改进的加权最小二乘法来得到未知节点的坐标,减小了节点的定位误差。仿真结果表明,在不需要增加额外的硬件设施的基础上,改进算法的定位精度相比于原算法明显提高。Aiming at the problem that the DV-Hop algorithm would produce fairly large errors when calculating the distances between unknown nodes and the anchor nodes, an improved DV-Hop algorithm is proposed. The improved algorithm implements weighted processing on the average hop distance and the local average hop distance of the whole network, thus to acquire the average hop distance of unknown nodes. Then an improved weighted least-square algorithm for the coordinates of unknown nodes is proposed, and the proposed algorithm could reduce the position errors of the nodes. The simulation results show that the improved algorithm could, with on addition of hardwares, obviously improve the localization accuracy as compared with the original algorithm.
分 类 号:TN919[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.173