Path Planning for Mobile-Anchor Based Wireless Sensor Networks Localization: Obstacle-Presence Schemes

Abstract

In many Wireless Sensor Network (WSN) applications, the location of the nodes in the network is required. A logical method to find Unknown Nodes (UNNs) in the network is to use one or several mobile anchors (MAs) equipped with GPS units moving between UNNs and periodically broadcast their current location. The main challenge at this stage is to design an optimum path to estimate the locations of UNNs as accurately as possible, reach all nodes in the network, and complete the localization process as quickly as possible. This article proposes a new path planning approach for MA-based localization called Nested Hexagon Curves (NHexCurves). The proposed model’s performance is compared with the performance of five existing static path planning models using Weighted Centroid Localization (WCL) and Accuracy Priority Trilateration (APT) localization techniques in the obstacle-presence scenario. With the obstacle-handling trajectories used for the models, the negative impact of the obstacle on the localization is reduced. The proposed model provides full coverage and high localization accuracy in the obstacle-presence scenario. The simulation results show the advantages of the proposed path planning model with the H-curve model over existing schemes.

Keywords

• localization
• mobile anchor node assisted localization
• obstacle-handling
• path planning
• static path planning