面向无测距定位的移动锚点路径规划算法设计
Designing Path Planning Algorithms for Mobile Anchor towards Range-Free Localization
摘要：
定位是无线传感器网络中最重要的因素之一，因为许多应用都需要传感器的位置信息。最近有一个越来越多的兴趣使用移动锚定位传感器。现有文献中的大多数工作要么着眼于减少移动锚的路径长度方面，要么试图提高定位精度。面临的挑战是为移动锚设计一种移动策略，该移动锚在满足良好的无距离定位技术的要求的同时减少路径长度。在本文中，我们提出了两个具有成本效益的运动策略，即，移动锚点的路径规划，使得可以使用定位方案\cite{Lee2009}来完成定位。在一种策略中，我们使用一个六边形的移动锚的移动模式，以本地化所有传感器内的有界矩形区域较少的运动相比，现有的作品在文献中。在其他策略中，我们考虑一个连接的网络在一个无界的区域，移动锚移动的六边形模式定位传感器。在这种方法中，我们保证定位的所有传感器在$r/2$误差范围内，其中$r$是移动锚和传感器的通信范围。我们的仿真结果支持理论结果以及定位精度。
英文摘要：
Localization is one of the most important factor in wireless sensor networks as many applications demand position information of sensors. Recently there is an increasing interest on the use of mobile anchors for localizing sensors. Most of the works available in the literature either looks into the aspect of reducing path length of mobile anchor or tries to increase localization accuracy. The challenge is to design a movement strategy for a mobile anchor that reduces path length while meeting the requirements of a good range-free localization technique. In this paper we propose two cost-effective movement strategies i.e., path planning for a mobile anchor so that localization can be done using the localization scheme \cite{Lee2009}. In one strategy we use a hexagonal movement pattern for the mobile anchor to localize all sensors inside a bounded rectangular region with lesser movement compared to the existing works in literature. In other strategy we consider a connected network in an unbounded region where the mobile anchor moves in the hexagonal pattern to localize the sensors. In this approach, we guarantee localization of all sensors within $r/2$ error-bound where $r$ is the communication range of the mobile anchor and sensors. Our simulation results support theoretical results along with localization accuracy.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
