基于WBOA的3D-DV-Hop节点定位算法

针对三维(3D)-DV-Hop定位算法未知节点从最近的锚节点获取平均跳距估算距离时定位精度低的问题,提出了一种新的基于WBOA的3D-DV-Hop算法。首先,该算法去除了网络中无法通信和无法定位的节点;然后添加了修正因子,修正平均跳距。接着创建一个用于优化的蝴蝶初始种群,构建目标函数。采用自适应权重来平衡全局搜索与局部搜索的能力,使得算法不易陷入局部最优,加快了算法的收敛精度;最终求得全局最优平均跳距。仿真结果表明:尽管算法的平均运行时间略有增加,但算法的定位精度得到了有效提高。

多策略改进的蜣螂搜索算法优化3DDV-Hop节点定位

为了提升传统3DDV-Hop算法的定位精度和稳定性,提出了MIDBO-3DDV-Hop算法。该算法利用多策略改进蜣螂搜索算法(multi strategy improvement dung beetle optimizer, MIDBO)来提高3DDV-Hop算法的定位精度。该算法通过通信半径分级方法细化跳数,使用加权平均跳距来修正节点之间的跳距误差。MIDBO算法引入立方混沌初始化和反向折射机制来初始化算法种群,采用变螺旋策略增强全局搜索能力。算法还融入Levy飞行策略和自适应权重因子,以避免陷入局部最优,并平衡算法的收敛性和搜索多样性。通过MIDBO算法对3DDV-Hop算法中未知节点位置进行优化。仿真结果显示,与传统的3DDV-Hop、IPSO-3DDV-Hop和IGA-3DDV-Hop算法相比,MIDBO-3DDV-Hop算法在定位精度、稳定性和收敛速度方面均达到最优水平。

非均匀网络中半径可调的ARDV-Hop定位算法

针对无线传感网络中传统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算法能更有效地降低定位误差.

基于分类平均跳距的无线传感器网络节点CADV-Hop定位方法

针对原型DV-Hop定位算法中平均跳距的计算产生较大定位误差的问题,提出了一种分类平均跳距的CADV-Hop算法。首先,揭示了无线传感网络中不同跳数路径的单跳距离分布不一致的现象,并分析了这种差异出现的原因与规律。其次,按照跳数对信标间路径分类再计算各类路径平均跳距的分类平均跳距。最后,在分类平均跳距所提供未知节点与最近信标节点之间更精确距离估计的基础上,结合加权最小二乘法最终实现节点坐标解算。仿真实验表明,CADV-Hop算法在不增加算法复杂度以及额外硬件的情况下有效地降低了定位误差,随着信标节点数量增加,CADV-Hop算法比原型DV-Hop算法和两种改进的DV-Hop算法具有更高的定位精度。

基于多应用场景的改进DV-Hop定位模型

针对距离矢量跳(DV-Hop)定位模型定位精度低、优化策略场景依赖性强的问题,提出一种基于函数分析和模拟定参的改进DV-Hop模型——函数修正距离矢量跳(FuncDV-Hop)定位模型。首先,分析DV-Hop模型的平均跳距、距离估计和最小二乘法中的误差原因,引入待定系数优化、阶跃函数分段实验、带等效点的权重函数策略和极大似然估计修正;其次,考虑多应用场景,用控制变量法,分别将总节点数、信标节点比例、通信半径、信标节点数和待测节点数作为变量,设计对照实验;最后,进行仿真定参和整合优化测试两阶段实验,最终的改进策略较原DV-Hop模型的定位精度提高了23.70%~75.76%,平均优化率57.23%。实验结果表明,FuncDV-Hop模型的优化率最高达到了50.73%,与基于遗传算法和神经动力学改进的DV-Hop模型相比,FuncDV-Hop模型的优化率提升了0.55%~18.77%。所提模型不引入其他参量,不增加无线传感器网络(WSN)的协议开销,且有效提高定位精度。

基于模拟退火和樽海鞘群优化的DV-Hop定位算法

针对无线传感器网络(WSNs)中传统DV-Hop算法定位误差较大等问题,提出基于模拟退火和樽海鞘群优化的DV-Hop定位算法。该算法分别引入RSSI和修正因子来量化最小跳数以及校正平均跳距,在未知节点估计过程中,采用改进的樽海鞘群优化算法代替最小二乘法,并且与模拟退火算法相结合,缓解了樽海鞘群优化算法在寻优过程中容易陷入局部最优的缺点。仿真结果表明:改进后的DV-Hop算法相比于传统DV-Hop定位算法以及其他智能优化算法,定位精度得到明显改善。

基于测距修正和秃鹫优化的DV-Hop改进算法

针对传统距离矢量跳(DV-Hop)算法在各向异性网络中定位误差大的问题,提出一种基于测距修正和秃鹫优化的DV-Hop改进算法(AVOADV-Hop)。该算法在双通信半径的基础上依据锚节点间的跳数信息引入测距修正阈值,根据锚节点的坐标信息计算基于跳数改进的平均跳距,实现节点间距离估算的分段处理;融合动态调整和加权思想改进非洲秃鹫优化算法取代最小二乘法求解节点坐标。仿真结果表明,在3种不规则网络下,AVOADV-Hop算法相较于传统DV-Hop算法及相关改进算法,定位误差分别下降了43.6%、21.1%和10.5%,定位精度有效提高。

基于改进麻雀搜索算法的3DDV-Hop定位算法

针对经典3DDV-Hop算法定位精度不高的问题,提出一种基于改进麻雀搜索算法优化的改进的3DDV-Hop算法;算法首先通过多通信半径优化传感器节点之间跳数,并且在平均跳距计算过程中引入动态加权因子提高平均跳距计算精度,其次在麻雀搜索算法的基础上融合反向学习策略与萤火虫算法分别对麻雀搜索算法的种群与位置更新迭代进行优化,最后将未知节点坐标计算问题转化成改进后的麻雀搜索算法寻优问题,利用改进后的麻雀搜索算法替代最小二乘法计算未知节点坐标,进一步提高未知节点位置计算精度;经过MATLAB仿真验证,改进算法对比于经典3DDV-Hop算法和相关算法,定位精度得到有效提高。

Elevating Localization Accuracy in Wireless Sensor Networks:A Refined DV-Hop Approach

Localization is crucial in wireless sensor networks for various applications,such as tracking objects in outdoor environments where GPS(Global Positioning System)or prior installed infrastructure is unavailable.However,traditional techniques involve many anchor nodes,increasing costs and reducing accuracy.Existing solutions do not address the selection of appropriate anchor nodes and selecting localized nodes as assistant anchor nodes for the localization process,which is a critical element in the localization process.Furthermore,an inaccurate average hop distance significantly affects localization accuracy.We propose an improved DV-Hop algorithm based on anchor sets(AS-IDV-Hop)to improve the localization accuracy.Through simulation analysis,we validated that the ASIDV-Hop proposed algorithm is more efficient in minimizing localization errors than existing studies.The ASIDV-Hop algorithm provides an efficient and cost-effective solution for localization in Wireless Sensor Networks.By strategically selecting anchor and assistant anchor nodes and rectifying the average hop distance,AS-IDV-Hop demonstrated superior performance,achieving a mean accuracy of approximately 1.59,which represents about 25.44%,38.28%,and 73.00%improvement over other algorithms,respectively.The estimated localization error is approximately 0.345,highlighting AS-IDV-Hop’s effectiveness.This substantial reduction in localization error underscores the advantages of implementing AS-IDV-Hop,particularly in complex scenarios requiring precise node localization.

Quantum correlations and entanglement in coupled optomechanical resonators with photon hopping via Gaussian interferometric power analysis

Quantum correlations that surpass entanglement are of great importance in the realms of quantum information processing and quantum computation.Essentially,for quantum systems prepared in pure states,it is difficult to differentiate between quantum entanglement and quantum correlation.Nonetheless,this indistinguishability is no longer holds for mixed states.To contribute to a better understanding of this differentiation,we have explored a simple model for both generating and measuring these quantum correlations.Our study concerns two macroscopic mechanical resonators placed in separate Fabry–Pérot cavities,coupled through the photon hopping process.this system offers a comprehensively way to investigate and quantify quantum correlations beyond entanglement between these mechanical modes.The key ingredient in analyzing quantum correlation in this system is the global covariance matrix.It forms the basis for computing two essential metrics:the logarithmic negativity(E_(N)^(m))and the Gaussian interferometric power(P_(G)^(m)).These metrics provide the tools to measure the degree of quantum entanglement and quantum correlations,respectively.Our study reveals that the Gaussian interferometric power(P_(G)^(m))proves to be a more suitable metric for characterizing quantum correlations among the mechanical modes in an optomechanical quantum system,particularly in scenarios featuring resilient photon hopping.

A Synchronization Acquisition Algorithm Based on the Frequency Hopping Pulses Combining

As modern electromagnetic environments are more and more complex,the anti-interference performance of the synchronization acquisition is becoming vital in wireless communications.With the rapid development of the digital signal processing technologies,some synchronization acquisition algorithms for hybrid direct-sequence(DS)/frequency hopping(FH)spread spectrum communications have been proposed.However,these algorithms do not focus on the analysis and the design of the synchronization acquisition under typical interferences.In this paper,a synchronization acquisition algorithm based on the frequency hopping pulses combining(FHPC)is proposed.Specifically,the proposed algorithm is composed of two modules:an adaptive interference suppression(IS)module and an adaptive combining decision module.The adaptive IS module mitigates the effect of the interfered samples in the time-domain or the frequencydomain,and the adaptive combining decision module can utilize each frequency hopping pulse to construct an anti-interference decision metric and generate an adaptive acquisition decision threshold to complete the acquisition.Theory and simulation demonstrate that the proposed algorithm significantly enhances the antiinterference and anti-noise performances of the synchronization acquisition for hybrid DS/FH communications.

Gigahertz frequency hopping in an optical phase-locked loop for Raman lasers

Raman lasers are essential in atomic physics,and the development of portable devices has posed requirements for time-division multiplexing of Raman lasers.We demonstrate an innovative gigahertz frequency hopping approach of a slave Raman laser within an optical phase-locked loop(OPLL),which finds practical application in an atomic gravimeter,where the OPLL frequently switches between near-resonance lasers and significantly detuned Raman lasers.The method merges the advantages of rapid and extensive frequency hopping with the OPLL’s inherent low phase noise,and exhibits a versatile range of applications in compact laser systems,promising advancements in portable instruments.

Joint Beam Scheduling and Power Optimization for Beam Hopping LEO Satellite Systems

Low earth orbit(LEO) satellite communications can provide ubiquitous and reliable services,making it an essential part of the Internet of Everything network. Beam hopping(BH) is an emerging technology for effectively addressing the issue of low resource utilization caused by the non-uniform spatio-temporal distribution of traffic demands. However, how to allocate multi-dimensional resources in a timely and efficient way for the highly dynamic LEO satellite systems remains a challenge. This paper proposes a joint beam scheduling and power optimization beam hopping(JBSPO-BH) algorithm considering the differences in the geographic distribution of sink nodes. The JBSPO-BH algorithm decouples the original problem into two sub-problems. The beam scheduling problem is modelled as a potential game,and the Nash equilibrium(NE) point is obtained as the beam scheduling strategy. Moreover, the penalty function interior point method is applied to optimize the power allocation. Simulation results show that the JBSPO-BH algorithm has low time complexity and fast convergence and achieves better performance both in throughput and fairness. Compared with greedybased BH, greedy-based BH with the power optimization, round-robin BH, Max-SINR BH and satellite resource allocation algorithm, the throughput of the proposed algorithm is improved by 44.99%, 20.79%,156.06%, 15.39% and 8.17%, respectively.

Moisture‑Electric–Moisture‑Sensitive Heterostructure Triggered Proton Hopping for Quality‑Enhancing Moist‑Electric Generator

Moisture-enabled electricity(ME)is a method of converting the potential energy of water in the external environment into electrical energy through the interaction of functional materials with water molecules and can be directly applied to energy harvesting and signal expression.However,ME can be unreliable in numerous applications due to its sluggish response to moisture,thus sacrificing the value of fast energy harvesting and highly accurate information representation.Here,by constructing a moisture-electric-moisture-sensitive(ME-MS)heterostructure,we develop an efficient ME generator with ultra-fast electric response to moisture achieved by triggering Grotthuss protons hopping in the sensitized ZnO,which modulates the heterostructure built-in interfacial potential,enables quick response(0.435 s),an unprecedented ultra-fast response rate of 972.4 mV s^(−1),and a durable electrical signal output for 8 h without any attenuation.Our research provides an efficient way to generate electricity and important insight for a deeper understanding of the mechanisms of moisture-generated carrier migration in ME generator,which has a more comprehensive working scene and can serve as a typical model for human health monitoring and smart medical electronics design.

基于多通信半径与改进阿基米德算法的DV-Hop定位算法

针对距离向量-跳距(distance vector-hop,DV-Hop)定位算法中未知节点估计位置与实际位置偏差较大的问题,提出了基于多通信半径与改进阿基米德算法的DV-Hop定位算法。首先,采用锚节点通信半径多级数分层的方法,减小未知节点最小跳数选取的误差;然后,对阿基米德算法中三个步骤进行改进,提高了算法的性能;最后,通过改进的阿基米德算法计算未知节点坐标。实验结果表明,相同环境下,提出的改进算法具有更好的定位效果。

基于螺旋更新策略蜜獾优化的DV-Hop定位算法

节点定位是无线传感器网络(Wireless Sensor Networks,WSNs)的关键技术之一。针对传统距离向量跳段(Distance Vector Hop,DV-Hop)算法定位误差偏大的问题,提出了一种改进蜜獾算法(Honey Badger Algorithm,HBA)与DV-Hop相结合的算法。首先,针对网络平均跳距估计不准的问题,依据锚节点比例对未知节点平均跳距进行分段修正。其次,采用改进型的HBA替换最小二乘法估算未知节点的位置,进一步降低计算误差。初始化蜜獾个体时引入Sobol序列,增加初始种群的多样性;为了加强HBA的局部搜索能力,引入了螺旋更新策略。最后,采用镜像策略规避估算位置越界的情况。结果表明,所提算法相较于传统DV-Hop算法、平均跳距修正的DV-Hop算法和基于粒子群优化(Particle Swarm Optimization,POS)的DV-Hop算法具有更高的定位精度和稳健性。

无线传感器网络DV-Hop定位算法的改进

在无线传感器网络中,节点定位占有极其重要的一席之地。无需测距方案中的DV-Hop算法因其计算简单易于实现得到广泛应用。传统DV-Hop算法不能够提供相对好的定位精度,为了保证定位的准确性,文章对DV-Hop算法进行了优化。在优化算法中,采用加权误差修正锚节点的估计平均跳距使其更加接近实际值,之后采用二维双曲线算法代替三边法或最小二乘算法确定接近实际位置的待测节点坐标。仿真结果验证了文章提出算法在无线传感器网络中定位的准确性。

基于双通信半径的传感器网络DV-Hop定位算法

为了减少传统的DV—Hop算法对未知节点定位时产生的较大误差，分析了影响传统DV—Hop算法定位精度的两个因素，继而提出了一种改进算法。改进算法在进行未知节点定位时，信标节点先后使用两个通信半径广播自身位置信息，从而获得未知节点与信标节点间更精确的跳数，并计算出它们之间更精确的距离，得到未知节点更精确的坐标。仿真结果显示，改进算法相比于传统DV—Hop算法相对定位误差减少了13%～15%，并且减少了由于网络拓扑结构不同带来的定位误差的差异性。

基于RSSI每跳分级和跳距修正的DV-HOP改进算法

针对DV-HOP(distance vector hop)算法的定位精度对节点间跳数信息依赖性较强的特点,提出一种基于接收信号强度指示(received signal strength indicator,RSSI)每跳分级和平均跳距修正的DV-HOP改进算法RADV-HOP(RSSI and average hopping distance modifying DV-HOP)。仿真结果表明:在相同的网络环境里,与传统DV-HOP算法相比,RADV-HOP定位算法仅需节点通信芯片带有RSSI指示功能及增加少量的计算和通信开销,不需要额外的硬件开销,将每跳分为3个子级时,归一化定位误差能下降65%;与其他DV-HOP修正算法相比,RADV-HOP算法以相同的通信开销和稍微增加的计算开销使定位误差下降了45%。

基于RSSI跳数修正的DV-Hop改进算法

针对原始DV-Hop算法中跳数值不能反应出节点间实际距离大小而导致拓扑不规则网络中节点定位误差较大的问题,提出了一种基于接收信号强度指示RSSI(Rceived Sgnal Srength Idicator)的改进算法。首先根据直接邻居节点接收到的RSSI值对第1跳进行分级,细化跳数;同时把节点间的距离比值作为权值,并将其转化为相应RSSI的关系对跳数进行加权修正,使获得的跳数值更准确。仿真结果表明在相同的网络环境下,与传统算法相比改进算法在不增加额外硬件的前提下有效地提高了定位精度。