检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘龙飞 倪晓军[1] Liu Longfei;Ni Xiaojun(School of Computer Science,Nanjing University of Posts and Telecommunications,Nanjing 210023,China)
出 处:《国外电子测量技术》2024年第10期17-25,共9页Foreign Electronic Measurement Technology
摘 要:针对传统距离矢量跳(DV-Hop)算法在各向异性网络中定位误差大的问题,提出一种基于测距修正和秃鹫优化的DV-Hop改进算法(AVOADV-Hop)。该算法在双通信半径的基础上依据锚节点间的跳数信息引入测距修正阈值,根据锚节点的坐标信息计算基于跳数改进的平均跳距,实现节点间距离估算的分段处理;融合动态调整和加权思想改进非洲秃鹫优化算法取代最小二乘法求解节点坐标。仿真结果表明,在3种不规则网络下,AVOADV-Hop算法相较于传统DV-Hop算法及相关改进算法,定位误差分别下降了43.6%、21.1%和10.5%,定位精度有效提高。To solve the problem of large positioning error of traditional DV-Hop algorithm in anisotropic network,an improved DV-Hop algorithm based on range correction and vulture optimization(AVOADV-Hop)is proposed.Based on the double communication radius,the algorithm introduces the distance correction threshold according to the hop number information between anchor nodes,and calculates the average hop distance based on the hop number improvement according to the position information of anchor nodes,and realizes the segmentation processing of the distance estimation between nodes.Combining dynamic adjustment and weighted ideas,the African vulture optimization algorithm replaces the least square method to solve the node coordinates.The simulation results show that the positioning errors of AVOADV-Hop algorithm are reduced by 43.6%,21.1%and 10.5%,respectively,compared with the traditional DVHop algorithm and the improved algorithm,and the positioning accuracy is effectively improved in three irregular networks.
关 键 词:各向异性网络 DV-HOP算法 非洲秃鹫优化算法 节点定位
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7