检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机系统应用》2012年第4期130-134,共5页Computer Systems & Applications
摘 要:阐述了DV-Hop算法的基本原理。针对原算法中由于节点间跳数过大及小范围的部分节点聚集形成的相似误差使得未知节点的定位精度不高的问题,提出了一种修正DV-Hop定位算法。新算法通过设置门限值修正节点间的跳数,并利用信标节点的估计坐标和实际位置的偏差作为修正因子来修正未知节点的定位结果,同时剔除区域外的未知节点,提高了跳段距离估算精度,降低了定位误差。仿真实验结果表明,在不增加额外硬件的基础上,修正算法的定位精度明显要优于原算法,证明了修正算法的正确性。This paper describes the basic principles of DV-Hop algorithm. As for the original DV-Hop algorithm, the number of hops between nodes is too large and some small part of nodes assembled can cause a analogue error, both of which make the positioning accuracy of unknown nodes not high. To overcome these shortcomings, a modified DV-Hop localization algorithm is proposed. The new algorithm modifies the number of hops between nodes by setting the threshold and use the estimate coordinates of beacon nodes and the deviations of actual position as a correction factor to correct positioning results of unknown nodes. It is the proposed algorithm that not only improves the estimation accuracy of jump distance but also reduces the positioning errors and removes the unknown nodes outside the region. The experimental results have shown that the positioning accuracy based on modified algorithm is much better than original one without adding additional hardware, and proved the correctness of the improved algorithm.
分 类 号:TP212.9[自动化与计算机技术—检测技术与自动化装置] TN929.5[自动化与计算机技术—控制科学与工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.98.87