首页 | 本学科首页   官方微博 | 高级检索  
     

节点分区与平均跳数加权的三维DV-Hop定位算法
引用本文:张伯泉,王瑞成.节点分区与平均跳数加权的三维DV-Hop定位算法[J].计算机工程与应用,2018,54(12):240-243.
作者姓名:张伯泉  王瑞成
作者单位:广东工业大学 计算机学院,广州 510006
摘    要:针对三维DV-Hop定位算法的两个重要定位因素——网络锚节点的平均跳距与未知节点到锚节点的跳数存在的固有缺点,提出一种改进的三维DV-Hop定位算法3DPHW-DVHop(Partial HopSize Weighted)。改进算法在求网络平均跳距时,利用区域划分和节点跳数加权进行算法综合优化,最后用极大似然法估算未知节点的位置,经过对理论的分析和仿真实验的证明,得出基于区域划分的跳数加权的三维DV-Hop定位算法在同等环境条件下比传统DV-Hop定位算法定位精度明显提高。

关 键 词:三维定位  分区加权  DistanceVectorHop(DV-Hop)  无线传感网络  

Three-dimensional DV-Hop localization algorithm based on node partitioning and node-based average hop weighting
ZHANG Boquan,WANG Ruicheng.Three-dimensional DV-Hop localization algorithm based on node partitioning and node-based average hop weighting[J].Computer Engineering and Applications,2018,54(12):240-243.
Authors:ZHANG Boquan  WANG Ruicheng
Affiliation:School of Computer, Guangdong University of Technology, Guangzhou 510006, China
Abstract:Because of the inherent shortcomings of the two important localization factors of the DV-Hop localization algorithm:The average hop distance of the network anchor nodes and the number of hops of the unknown nodes to the anchor nodes, an improved 3D-DVHop localization algorithm 3DPHW-DVHop(Partial HopSize Weighted) is put forward. When the average hop distance of the network is calculated, the algorithm is optimized by region partitioning and hops count weighting. Finally, the maximum likelihood method is used to estimate the position of the unknown node. After analyzing the theory and proving the simulation experiment, it is concluded that the 3D-DVHop localization algorithm based on the region partitioning and hops count weighting is significantly improved by comparsion with the traditional DV-Hop localization algorithm under the same conditions.
Keywords:three-dimensional localization  partition weighting  DV-Hop  wireless sensor network  
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号