面向WSN节点定位的多移动导标节点路径规划

Path Planning for Multiple-mobile Beacons in Localization for Wireless Sensor Networks

针对移动导标节点定位中的路径规划问题,提出了一种通过移动导标节点,根据搜集的未知节点多跳信息,从而获得其通信范围内未定位节点的邻居节点数量的方法。利用该方法移动导标就可以向邻居节点数量最多的节点移动,以较短的移动路径定位尽量多的未知节点,还可以利用多个移动导标相互协作,使绝大多数无线传感器节点得到有效定位。仿真结果表明,与传统的路径规划算法相比,该方法在移动路径长度上具有明显的优越性。

Aiming at path planning problems in mobile beacons localization,a method of the mobile beacon was provided to get the number of unknown neighbors of the nodes that were within the beacon′s communication range according to multi-hop information.Using this method the beacon could move to the node with the most unknown neighbors and to visit as much nodes as possible in a shorter path.It could also be realized that a vast majority of nodes were localized by the collaboration of mobile beacons.Simulation results showed that the algorithm proposed in this paper had obvious advantage in the length of path compared with traditional path planning algorithm.