Mobile Anchor Route Scheduling with an Iterative Sensor Positioning Algorithm in Wireless Sensor Networks

Abstract

Locating deployed sensor nodes in wireless sensor networks is a crucial issue for general environmental monitoring applications. Most current positioning technologies use stationary anchors to compute the positions of sensor nodes. However, placing the static anchors in the monitoring area is not a trivial job, especially in hazardous environments. Applying a mobile anchor is a good solution. This paper proposes an iterative sensor positioning (ISP) algorithm that uses the neighboring-positioned nodes to assist the mobile anchor in locating the unknown nodes. In addition, a mobile anchor route scheduling method, named MARS, is also proposed to shorten the traveling distance of the mobile anchor. MARS uses a projection mechanism and the ISP algorithm to reduce the traveling distance. Simulation results indicate that MARS can reduce the traveling distance of the mobile anchor by about 21–49% compared with the SCAN method. In the unfavorable scenario of the projection mechanism, MARS still provides the mobile anchor with a traveling distance that is 34% less than the SCAN method. The mobile anchor, when applying the MARS method, is able to locate all unknown nodes in only 45% to 70% of the traveling distance required by the one using the SCAN method in the scenario favorable to the ISP algorithm, while still reducing the traveling distance by 15% to 21% in the scenario unfavorable to the ISP algorithm. In the non-ideal signal scenario, the positioning size of the positioning area of the ISP algorithm when using the MARS method is about 53% to 74% less than when using the Triangulation algorithm.