基于最小跳数改进的三维DV-Hop定位算法  

Three-Dimensional DV-Hop Localization Algorithm Based on Improved Minimum Hop Count

作　　者：胡远 乔建华[1] HU Yuan;QIAO Jian-hua(School of Electronic and Information Engineering,Taiyuan University of Science and Technology,Taiyuan 030024,China)

机构地区：[1]太原科技大学电子信息工程学院,太原030024

出　　处：《太原科技大学学报》2021年第4期266-270,276,共6页Journal of Taiyuan University of Science and Technology

基　　金：太原科技大学博士启动基金(20182053)。

摘　　要：节点定位技术在三维无线传感器网络应用中发展迅速,DV-Hop定位算法通过计算节点间的距离来对节点进行定位,针对这种定位算法存在依赖网络节点分布情况、定位精度低且不稳定等缺点。提出一种基于最小跳数修正的三维DV-Hop定位算法,使得节点间的跳数更加精确。仿真结果表明,改进的双通信半径定位算法比传统的三维DV-Hop算法具有更小的定位误差。Node location technology is developing rapidly in 3D wireless sensor network applications.DV-Hop localization algorithm locates nodes by calculating the distance between nodes.The localization algorithm depends on the distribution of network nodes,and its localization accuracy is low and unstable.A three-dimensional DV-Hop localization algorithm based on minimum hop correction is proposed to make the hop count between nodes more accurate.The simulation results show that the improved dual communication radius localization algorithm has smaller positioning error than the traditional three-dimensional DV-Hop algorithm.

关 键 词：无线传感器网络 DV-HOP 三维定位 双通信半径 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]