检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:马千里[1] 钱惠梦 张琦 齐鑫 MA Qianli;QIAN Huimeng;ZHANG Qi;QI Xin(College of Computer and Information Technology,Shanxi University,Taiyuan Shanxi 030006,China)
机构地区:[1]山西大学计算机与信息技术学院,山西太原030006
出 处:《传感技术学报》2024年第9期1613-1621,共9页Chinese Journal of Sensors and Actuators
基 金:国家自然科学基金项目(62076155);山西省自然科学基金(202303021221074)。
摘 要:针对无线传感网络中传统DV-Hop(Distance Vector Hop)定位算法节点分布不均匀导致定位误差较大的问题,提出了非均匀网络中半径可调的ARDV-Hop(Adjustable Radius DV-Hop in Non-uniform Networks)定位算法。该算法通过半径可调的方式对节点间的跳数进行细化,用细化后呈小数级的跳数代替传统的整数级跳数,并建立了数据能量消耗模型,优化了网络传输性能。ARDV-Hop算法还针对节点分布不均匀的区域提出跳距优化算法:在节点密度大的区域,采用余弦定理优化跳距;密度小的区域,采用最小均方误差(Least Mean Square,LMS)来修正跳距。仿真实验表明,在同等网络环境下,与传统DV-Hop算法、GDV-Hop算法和WOA-DV-Hop算法相比,ARDV-Hop算法能更有效地降低定位误差.For the problem of large localization error caused by uneven distribution of nodes in traditional DV-Hop(Distance Vector Hop)localization algorithm in wireless sensing networks,an ARDV-Hop localization algorithm with adjustable radius in non-uniform networks is proposed.The number of hops between nodes is refined by means of adjustable radius,the traditional integer-level hops are replaced with fractional-level hops after refinement,and a data energy consumption model is established to optimize the network transmission perform-ance.A hop distance optimization algorithm is also proposed for regions with uneven node distribution,i.e.,in regions with high node den-sity,the cosine theorem is used to optimize the hop distance,and in regions with low density,the minimum mean square error(LMS)is used to optimize the hop distance.Simulation experiments show that the ARDV-Hop algorithm can reduce the localization error more effec-tively than the traditional DV-Hop algorithm,GDV-Hop algorithm and WOA-DV-Hop algorithm under the same network environment.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.133.137.102