Path planning for a group of mobile anchor nodes based on regular triangles in wireless sensor networks
Path planning for a group of mobile anchor nodes based on regular triangles in wireless sensor networks
复制标题
无线传感器网络中基于正三角形的一组移动锚节点路径规划
DOI：
10.1016/j.neucom.2016.10.097
复制
发表时间：
2017-12-27
期刊：
影响因子：
6
通讯作者：
Yang, Xuan
中科院分区：
文献类型：
--
作者：
Han, Guangjie;Jiang, Jinfang;Yang, Xuan
定位是无线传感器网络中的一个基本问题。近来，已经提出了各种定位方法。然而，使用单个锚节点引入了相当长的定位延迟。因此，本文研究了一组移动的锚节点（GMAN）的路径规划问题。首先，提出了两种路径规划方案GSCAN和GTURN。GSCAN和GTURN都使用三个移动的锚节点，它们沿着设计的轨迹遍历整个网络，以帮助附近的未知节点进行定位。此外，为了提高未知节点的定位率，提出了两种边界策略，以保证锚节点的运动轨迹能够覆盖整个无线传感器网络。仿真结果表明，GSCAN和GTURN在定位率和能耗方面优于LMAT、RPGM和Ou的定位算法。(C)2017爱思唯尔B.V.保留所有权利。
Localization is one of the fundamental issues in Wireless Sensor Networks (WSNs). Recently, various localization methods have been proposed. However, using single anchor node introduces quite long localization delay. Therefore, the path planning problem of a Group of Mobile Anchor Nodes (GMAN) is studied in this paper. First, two path planning schemes named GSCAN and GTURN are proposed. Both GSCAN and GTURN use three mobile anchor nodes which traverse the entire network following the designed trajectory to help nearby unknown nodes with localization. Furthermore, in order to improve localization ratio of unknown nodes, two boundary strategies are proposed to guarantee that the movement trajectories of anchor nodes can cover the whole WSN. Simulation results show that GSCAN and GTURN can achieve better localization performance than LMAT, RPGM and Ou's in terms of higher localization ratio and lower energy consumption. (C) 2017 Elsevier B.V. All rights reserved.