Localization algorithms of Wireless Sensor Networks: a survey
Localization algorithms of Wireless Sensor Networks: a survey
复制标题
DOI：
10.1007/s11235-011-9564-7
复制
发表时间：
2013-04-01
影响因子：
2.5
通讯作者：
Hara, Takahiro
中科院分区：
文献类型：
--
作者：
Han, Guangjie;Xu, Huihui;Hara, Takahiro
在无线传感器网络中，定位是最重要的技术之一，因为它在许多应用中起着关键作用，例如，目标跟踪如果用户不能获得准确的位置信息，相关的应用就无法完成。大多数定位方法的主要思想是，一些具有已知坐标的部署节点（地标）（例如，装备有GPS的节点）发送具有其坐标的信标，以便帮助其他节点定位它们自己。一般来说，主要的定位算法分为两大类：基于距离的定位算法和不依赖距离的定位算法。本文根据地标和未知节点的移动状态，从一个新的角度对定位算法进行了重新分类，并对具有代表性的定位算法进行了详细的分析。此外，我们还对现有的定位算法进行了比较，并分析了无线传感器网络定位算法的未来研究方向。
In Wireless Sensor Networks (WSNs), localization is one of the most important technologies since it plays a critical role in many applications, e.g., target tracking. If the users cannot obtain the accurate location information, the related applications cannot be accomplished. The main idea in most localization methods is that some deployed nodes (landmarks) with known coordinates (e.g., GPS-equipped nodes) transmit beacons with their coordinates in order to help other nodes localize themselves. In general, the main localization algorithms are classified into two categories: range-based and range-free. In this paper, we reclassify the localization algorithms with a new perspective based on the mobility state of landmarks and unknown nodes, and present a detailed analysis of the representative localization algorithms. Moreover, we compare the existing localization algorithms and analyze the future research directions for the localization algorithms in WSNs.