基于邻节点空间顺序序列优化的DV-Hop定位算法  

An Improved DV-Hop Localization Algorithm Based on the Ordered Neighboring Nodes in Space

作　　者：钟进发[1] 许力[1] 叶阿勇[1] 

机构地区：[1]福建师范大学网络安全与密码技术重点实验室,福建福州350007

出　　处：《计算机系统应用》2010年第2期62-66,共5页Computer Systems & Applications

基　　金：福建省科技计划(2008F5020);福建省教育厅重点项目(JA07030);福建省自然科学基金(2008J0014)

摘　　要：针对典型的DV-Hop定位算法中未知节点在计算与信标节点间距离时估算的不足,在DV-Hop算法的基础上提出了一种优化定位精度的算法。考虑并分析了未知节点与信标节点的路径中相邻三个节点的通信边组成的夹角对计算距离的影响,提出了一种基于"邻节点空间顺序"序列标号法计算夹角的方案,实验仿真验证了该优化定位算法的有效性和可行性。The precision of DV-Hop localization algorithm is not good enough when it is used to compute the distance value between unknown nodes and beacon nodes. To overcome its disadvantage, a precision improved algorithm based on DV-Hop is proposed. The three neighboring nodes in the route of the unknown node to the beacon node are analyzed, and an improced DV-Hop Location Algorithm based on the Ordered Neighboring Nodes in Space is proposed. Simulation proves that the improved algorithm is effective and feasible.

关 键 词：无线传感器网络 节点定位 DV-HOP 邻节点空间顺序序列 

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