A Localization Algorithm Using a Mobile Anchor Node Based on Region Determination in Underwater Wireless Sensor Networks

At present, most underwater positioning algorithms improve the positioning accuracy by increasing the number of anchor nodes which resulting in the increasing energy consumption. To solve this problem, the paper proposes a localization algorithm assisted by mobile anchor node and based on region determination(LMRD), which not only improves the positioning accuracy of nodes positioning but also reduces the energy consumption. This algorithm is divided into two stages: region determination stage and location positioning stage. In the region determination stage, the target region is divided into several sub-regions by the region division strategy with the smallest overlap rate which can reduce the number of virtual anchor nodes and lock the target node to a sub-region, and then through the planning of mobile nodes to optimize the travel path, reduce the moving distance, and reduce system energy consumption. In the location positioning stage, the target node location can be calculated using the HILBERT path planning and trilateration. The simulation results show that the proposed algorithm can improve the positioning accuracy when the energy consumption is reduced.

Path Planning for Mobile Anchor Node in Localization Based on Ad-Hoc Localization Algorithm

For mobile anchor node static path planning cannot accord the actual distribution of node for dynamic adjustment. We take advantage of the high localization accuracy and low computational complexity of ad-hoc localization system( AHLos)algorithm. This article introduces mobile anchor nodes instead of the traditional fixed anchor nodes to improve the algorithm. The result shows that, through introduce the mobile anchor node, the information of initial anchor nodes can be configured more flexible.Meanwhile,with the use of the approximate location and the transition path,the distance and energy consumption of the mobile anchor node is greatly reduced.

3DT-PP:localization and path planning of mobile anchors over complex 3D terrains

Mobile anchors are widely used for localization in WSNs.However,special properties over 3D terrains limit the implementation of them.In this paper,a novel 3D localization algorithm is proposed,called 3 DT-PP,which utilizes path planning of mobile anchors over complex 3 D terrains,and simulations based upon the model of mountain surface network are conducted.The simulation results show that the algorithm decreases the position error by about 91%,8.7%and lowers calculation overhead by about 75%,1.3%,than the typical state-of-the-art localization algorithm(i.e.,'MDS-MAP','Landscape-3D').Thus,our algorithm is more potential in practical WSNs which are the characteristic of limited energy and 3D deployment.

Performance Evaluation of Mobility Anchor Point with Guard Load Reservation in Hierarchical Mobile IPv6

Hierarchical mobile IPv6 （HMIPv6） introduces a mobility anchor point to reduce the signaling overhead and handoff latency. In this paper, we apply the matrix-analytical approach to explore the performance measures of the ongoing mobile nodes （MNs） drop and new MNs block probabilities of mobility anchor point with a guard bandwidth reservation scheme. We apply the Markovian arrival process （MAP） to model ongoing MNs and new MNs. Five related performance measures are derived, including the long-term new MN block and ongoing MN drop probabilities, and the three short-term measures of average length of a block period and a non-block period, as well as the conditional ongoing MN drop probability during a block period. These performance measures greatly assist the guard bandwidth reservation mechanism in determining a proper threshold guard bandwidth. The results presented in this paper can provide guidelines for designing adaptive algorithms to adjust the threshold in the guard bandwidth reservation scheme.

Dual-Tone Radio Interferometric Positioning Systems for Multi-Target Localization Using a Single Mobile Anchor

In this paper, a low-cost dualtone radio interferometric positioning system using a single mobile anchor is proposed to locate multiple targets at the same time. We name it mDRIPS. In mDRIPS, each target continuously transmits a dual-tone signal with its dedicated frequencies, and the mobile anchor receives the signals at different positions along its trajectory, Neither time synchronization between the mobile anchor and the targets nor time synchronization among the targets is required. We take the instability of targets clocks into consideration and develop an ESPRIT-type algorithm to estimate frequencies of each dual-tone signal. Furthermore, the time of arrival （TOA） of each target signal is extracted from the phase estimates of the received dual-tone signals. After measuring several TOAs at different locations along the anchor＇s trajectory, each target can be located. Since the frequency difference of the two tones of each dualtone signal is designed to be smaller than the channel coherence bandwidth, the same fading effect on these two tones can be eliminated. Moreover, the integer ambiguity problem due to phase wrapping is investigated, and a localization algorithm to deal with a simplified ambiguity problem is proposed. Numerical results demonstrate the efficiency of the proposed mDRIPS.

Securing Display Path for Security-Sensitive Applications on Mobile Devices

While smart devices based on ARM processor bring us a lot of convenience,they also become an attractive target of cyber-attacks.The threat is exaggerated as commodity OSes usually have a large code base and suffer from various software vulnerabilities.Nowadays,adversaries prefer to steal sensitive data by leaking the content of display output by a security-sensitive application.A promising solution is to exploit the hardware visualization extensions provided by modern ARM processors to construct a secure display path between the applications and the display device.In this work,we present a scheme named SecDisplay for trusted display service,it protects sensitive data displayed from being stolen or tampered surreptitiously by a compromised OS.The TCB of SecDisplay mainly consists of a tiny hypervisor and a super light-weight rendering painter,and has only^1400 lines of code.We implemented a prototype of SecDisplay and evaluated its performance overhead.The results show that SecDisplay only incurs an average drop of 3.4%.

MPLPK:A mobile path localization protocol based on key nodes

To alleviate the localization error introduced by irregular sensor network deployment, a new mo bile path localization based on key nodes （MPLPK） protocol is proposed. It can recognize all con cave/convex nodes in the network as fixed anchor nodes, and simplify the following localization process based on these key nodes. The MPLPK protocol is composed of three steps. After all key nodes are found in the network, a mobile node applying improved minimum spanning tree （MST） algorithm is introduced to traverse and locate them. By taking the concave/convex nodes as anchors, the complexity of the irregular network can be degraded. And the simulation results demonstrate that MPEPK has 20% to 40% accuracy improvements than connectivity-based and anchor-free three-di- mensional localization （CATL） and approximate convex decomposition based localization （ACDL）.

双移动式搓丝工艺参数研究

为增加螺纹成型质量和效率,基于双移动式搓丝工艺,以HRB500螺纹钢搓丝成型过程为研究对象,利用DEFORM软件进行仿真,对搓丝过程中搓丝板的切向速度、径向进给速度和摩擦系数进行研究。结果表明:搓丝板切向速度是螺纹成型和加工效率的重要参数,径向速度可根据设备在合适的范围内选择较大值,通过对比确定参数为切向速度200mm/s,径向速度0.7mm/s或1.6mm/s,摩擦系数为0.7。本研究结论可为企业HRB500螺纹钢双移动式搓丝成型工艺参数的选择提供参考。

New Online DV-Hop Algorithm via Mobile Anchor for Wireless Sensor Network Localization

In many applications of Wireless Sensor Networks(WSNs),event detection is the main purpose of users.Moreover,determining where and when that event occurs is crucial;thus,the positions of nodes must be identified.Subsequently,in a range-free case,the Distance Vector-Hop(DV-Hop)heuristic is the commonly used localization algorithm because of its simplicity and low cost.The DV-Hop algorithm consists of a set of reference nodes,namely,anchors,to periodically broadcast their current positions and assist nearby unknown nodes during localization.Another potential solution includes the use of only one mobile anchor instead of these sets of anchors.This solution presents a new challenge in the localization of rang-free WSNs because of its favorable results and reduced cost.In this paper,we propose an analytical probabilistic model for multi-hop distance estimation between mobile anchor nodes and unknown nodes.We derive a non-linear analytic function that provides the relation between the hop counts and distance estimation.Moreover,based on the recursive least square algorithm,we present a new formulation of the original DV-Hop localization algorithm,namely,online DV-Hop localization,in WSNs.Finally,different scenarios of path planning and simulation results are conducted.

Adaptive path selection for the improved distributed mobility management

Current mobility management schemes usually represent centralized or hierarchical architectures,which force data traffic to be processed by a centralized mobility anchor.This allows the mobile node(MN)to be reachable anywhere and provides an efficient method for seamless session continuity.However,all of the signal messages and data traffic converge on particular mobility anchor,which causes excessive signaling and traffic at the centralized mobility anchor and single point of failure issues as data traffic increases.To overcome these limitations and handle increasing data traffic,the distributed mobility management(DMM)scheme has emerged as an alternative solution.Although previous researches have been conducted on DMM support,because their schemes employ an unconditional way to make direct paths after handover,they have some drawbacks,such as several signaling and chain of tunneling problems.Therefore,this paper introduces a new DMM scheme which adaptively creates a direct path.To support it,we present the path selection algorithm,which selects the most efficient path between a direct path and no direct path based on routing hops and traffic load.Through the performance analysis and results,we confirm that the proposed scheme is superior in terms of signaling and packet delivery costs.

空间云锚点在博物馆移动端信息导览中的应用研究

文章针对博物馆移动端信息导览的现状进行分析,探讨了空间云锚点技术在移动端导览系统中的应用可能性,并根据应用策略进行原型测试。以南京云锦博物馆为设计对象,根据空间云锚点技术的应用特征,优化博物馆的信息导览功能,为数字技术在博物馆智能导览系统中的应用实践提供设计参考。

Guest Editorial:Special issue on explainable AI empowered for indoor positioning and indoor navigation

The convergence of Internet of Things(IoT),vehicularad hoc network(VANET),and mobile ad hoc network relies on sensor networks to gather data from nodes or objects.These networks involve nodes,gateways,and anchors,operating on limited battery power,mainly used in broadcasting.IoT applications,like healthcare,smart cities,and transportation,often need position data and face challenges in delay sensitivity.Localisation is important in ITS and VANETs,influencing autonomous vehicles,collision warning systems,and road information dissemination.A robust localisation system,often combining GPS with techniques like Dead Reckoning and Image/Video Localisation,is essential for accuracy and security.Artificial intelligence(AI)integration,particularly in machine learning,enhances indoor wireless localisation effectiveness.Advancements in wireless communication(WSN,IoT,and massive MIMO)transform dense environments into programmable entities,but pose challenges in aligning self‐learning AI with sensor tech for accuracy and budget considerations.We seek original research on sensor localisation,fusion,protocols,and positioning algorithms,inviting contributions from industry and academia to address these evolving challenges.

基于双移动锚节点的无线传感器网络定位算法

为提高无线传感器节点的定位精度,降低定位能耗,提出一种基于鲸鱼优化算法和双移动锚节点的定位算法。使用两个移动锚节点按照设计的移动路径遍历整个部署区域,使用加权质心算法估算节点大致位置,使用鲸鱼优化算法提高定位精度。仿真结果表明,提出的路径比PP-MMAN、GTURN和GSCAN等其它使用多个移动锚节点的路径更短,降低了移动锚节点的能耗;所提路径规划算法配合使用鲸鱼优化算法的定位精度较高,受通信不规则度和测距误差的影响较小。

Geographic Drone-based Route Optimization Approach for Emergency Area Ad-Hoc Network

Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,localization,heterogeneous network,self-organization,and self-sufficient operation.In this background,the current study focuses on specially-designed communication link establishment for high connection stability of wireless mobile sensor networks,especially in disaster area network.Existing protocols focus on location-dependent communications and use networks based on typically-used Internet Protocol(IP)architecture.However,IP-based communications have a few limitations such as inefficient bandwidth utilization,high processing,less transfer speeds,and excessive memory intake.To overcome these challenges,the number of neighbors(Node Density)is minimized and high Mobility Nodes(Node Speed)are avoided.The proposed Geographic Drone Based Route Optimization(GDRO)method reduces the entire overhead to a considerable level in an efficient manner and significantly improves the overall performance by identifying the disaster region.This drone communicates with anchor node periodically and shares the information to it so as to introduce a drone-based disaster network in an area.Geographic routing is a promising approach to enhance the routing efficiency in MANET.This algorithm helps in reaching the anchor(target)node with the help of Geographical Graph-Based Mapping(GGM).Global Positioning System(GPS)is enabled on mobile network of the anchor node which regularly broadcasts its location information that helps in finding the location.In first step,the node searches for local and remote anticipated Expected Transmission Count(ETX),thereby calculating the estimated distance.Received Signal Strength Indicator(RSSI)results are stored in the local memory of the node.Then,the node calculates the least remote anticipated ETX,Link Loss Rate,and information to the new location.Freeway Heuristic algorithm improves the data speed,efficiency and determines the path and optimization problem.In comparison with other models,the proposed method yielded an efficient communication,increased the throughput,and reduced the end-to-end delay,energy consumption and packet loss performance in disaster area networks.

带线锚钉内固定治疗髌骨下极骨折的愈合效果及对患者膝关节活动度和膝关节功能的影响

目的探讨带线锚钉内固定治疗髌骨下极骨折的愈合效果及对患者膝关节活动度、膝关节功能的影响。方法选取2014年1月至2021年12月于苏锡通科技产业园区人民医院骨科就诊的40例髌骨下极骨折患者作为研究对象,根据治疗方法不同分为对照组与观察组,每组20例。对照组采用常规手术治疗,观察组采用带线锚钉内固定治疗,比较两组平均愈合时间、膝关节活动度、髌骨骨折功能及膝关节功能恢复效果。结果观察组愈合时间短于对照组,差异有统计学意义(P<0.05)。治疗后3、6个月,观察组膝关节活动度均大于对照组,差异有统计学意义(P<0.05);治疗后6个月,两组膝关节活动度均大于治疗后3个月,差异有统计学意义。治疗后3、6个月,观察组Bostman评分高于对照组,差异有统计学意义(P<0.05);治疗6个月后,两组Bostman评分均高于治疗后3个月,差异有统计学意义(P<0.05)。治疗后6个月,观察组膝关节功能恢复优良率高于对照组,差异有统计学意义(P<0.05)。结论带线锚钉内固定治疗髌骨下极骨折可促进骨折愈合,提高患者术后临床疗效,改善其膝关节功能。

中国结联合内排锚定治疗中大型肩袖损伤的临床疗效

目的探究与分析中国结联合内排锚定治疗中大型肩袖损伤的临床疗效。方法回顾性分析2020年4月—2022年2月郓城县人民医院收治的64例中大型肩袖损伤患者的临床资料,按照不同手术治疗方法分为对照组与观察组,每组32例。对照组采用内外排锚钉(双排锚定)固定治疗,观察组采用中国结联合内排锚定治疗,对比两组治疗效果。结果观察组手术时间、术中出血量、住院时间分别为(104.36±23.09)min、(40.98±6.10)mL、(10.33±1.12)d,与对照组比较,差异无统计学意义(P>0.05)。观察组并发症发生率为3.13%,与对照组比较,差异无统计学意义(P>0.05)。观察组术后视觉模拟评分法(Visual Analogue Scale,VAS)评分、Constant-Murley功能量表评分、美国肩肘外科医师评分系统(the American Shoulder and Elbow Surgeons,ASES)评分、肩关节活动度中前屈上举、外展上举、90°外展位外旋、90°外展位内旋角度分别为(1.25±0.22)分、(80.36±8.11)分、(76.99±4.02)分、(168.41±14.99)°、(165.98±20.02)°、(58.96±12.44)°、(48.69±12.36)°均优于对照组,差异有统计学意义(P<0.05)。结论中国结联合内排锚定治疗中大型肩袖损伤的临床效果突出,经过治疗后患者肩关节疼痛程度以及肩关节功能均得到了有效的改善,肩关节活动度较好,预后综合表现更好。

Anchor Vertex Selection for Enhanced Reliability of Traffic Offloading Service in Edge-Enabled Mobile P2P Social Networks

As the rapid growth of mobile social networks,mobile peer-to-peer(P2P)communications and mobile edge computing(MEC)have been developed to reduce the traffic load and improve the computation capacity of cellular networks.However,the stability of social network is largely ignored in the advances of P2P and MEC,which is related to the social relations between users.It plays a vital role in improving the efficiency and reliability of traffic offloading service.In this paper,we integrate an edge node and the nearby P2P users as a mobile P2P social network and introduce the problem of adaptive anchored(k,r)-core to maintain the stability of multiple mobile P2P networks.It aims to adaptively select and retain a set of critical users for each network,whose participation is critical to overall stability of the network,and allocate certain resource for them so that the maximum number of users of all networks will remain engaged and the traffic of cellular network can be minimized.We called the retained users as anchor vertices.To address it,we devise a peer-edge-cloud framework to achieve the adaptive allocation of resources.We also develop a similarity based onion layers anchored(k,r)-core(S-OLAK)algorithm to explore the anchor vertices.Experimental results based on a real large-scale mobile P2P data set demonstrate the effectiveness of our method.

一种基于移动锚节点的静态无线传感器网络定位算法(英文)

传感器网络由于资源受限,定位算法需要综合考虑定位精度,网络构建成本,通信、计算开销等多方面因素。本文采用移动锚节点并结合Bounding Box算法特点,提出一种基于移动锚节点的无线传感器网络定位算法(MBB)。算法原理简单,传感器节点无须任何附加硬件或附加数据通信,通信、计算复杂度较低。仿真实验表明该算法具有很高的定位精度,即使节点的实际通信半径小于理论通信半径,定位精度仍可保持在较高等级,算法定位精度与网络连通度无关。

面向无线传感器网络节点定位的移动锚节点路径规划

节点定位是无线传感器网络技术研究的一个基本问题,大多数无线传感器网络的应用和中间件技术都需要节点的位置信息.目前比较实用的定位方法是利用一些移动锚节点(如安装有GPS)根据有效的规划路径移动,通过发送包含其自身坐标的信息来定位其他节点,该方法不过多地增加无线传感器网络成本,还可以获得较高的定位精度.在该方法中,移动锚节点的路径规划问题是需要解决的基本问题.主要研究移动锚节点的路径规划问题,把图论引入到无线传感器网络节点定位系统.把无线传感器网络看成一个连通的节点无向图,路径规划问题转化为图的生成树及遍历问题,提出了宽度优先和回溯式贪婪算法.仿真实验和真实系统实验结果表明,该方法能够很好地适应无线传感器网络节点随机分布的节点定位,可以取得较高的定位精度.

无线传感器网络中基于移动锚节点的APIT的改进定位算法

针对APIT定位算法定位误差大,覆盖率低等缺点,提出了一种基于移动锚节点的改进的定位算法。在网络中引入移动锚节点,通过移动覆盖算法尽量使节点均匀分布,并提出了一种基于异构传感器网络的最佳节点数量的计算方法,另外引入了RSSI量化模型对APIT算法进行修正,解决了用APIT算法不能进行定位的问题。仿真结果表明,其与传统方法相比在定位精度和覆盖率等方面有较大提高。