检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机应用与软件》2015年第11期130-133,共4页Computer Applications and Software
摘 要:介绍无线传感器网络中质心算法与DV-Hop算法的定位原理、误差来源。针对已有算法在算法计算量过大、未知节点到信标节点距离计算存在误差等不足之处提出改进算法。改进算法不但修正了网络中节点的平均每跳距离,还在保证定位精度的前提下有效减少了算法的计算量。仿真结果表明,质心算法与DV-Hop算法结合的这种新型算法在定位精度方面较原有算法和已有改进算法均有所提高。In this paper we introduce the localisation principle and the error source in regard to centroid algorithm and DV-Hop algorithm in wireless sensor networks. To overcome the disadvantages of existing algorithms, such as the excessive computation load of the algorithms, and the errors in calculating the distance between unknown nodes and beacon nodes, we work out an improved algorithm. The improved algorithm not only corrects average distance per hop of the node in networks, it also reduces the calculation amount effectively under the premise of ensuring the precision of localisation. Results of the simulation show that the novel algorithm combining the centroid algorithm and DV-Hop algorithm has the improvement in loealisation accuracy compared with beth the previous and existing algorithms.
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.108.24