[Paper Review] Designing Path Planning Algorithms for Mobile Anchor towards Range-Free Localization

Kaushik Mondal, Arindam Karmakar+1 more|arXiv (Cornell University)|Aug 30, 2014

Indoor and Outdoor Localization Technologies20 references3 citations

TL;DR

This paper proposes two hexagonal path planning strategies for a mobile anchor in wireless sensor networks to enable range-free localization with reduced path length and improved accuracy. The first strategy uses connectivity-based movement in a connected network, localizing all sensors within r/2 error bound; the second covers a bounded rectangular region using boundary information. The proposed method reduces path length by 13.45% to 25.35% compared to existing schemes while maintaining high localization accuracy.

ABSTRACT

Localization is one of the most important factor in wireless sensor networks as many applications demand position information of sensors. Recently there is an increasing interest on the use of mobile anchors for localizing sensors. Most of the works available in the literature either looks into the aspect of reducing path length of mobile anchor or tries to increase localization accuracy. The challenge is to design a movement strategy for a mobile anchor that reduces path length while meeting the requirements of a good range-free localization technique. In this paper we propose two cost-effective movement strategies i.e., path planning for a mobile anchor so that localization can be done using the localization scheme \cite{Lee2009}. In one strategy we use a hexagonal movement pattern for the mobile anchor to localize all sensors inside a bounded rectangular region with lesser movement compared to the existing works in literature. In other strategy we consider a connected network in an unbounded region where the mobile anchor moves in the hexagonal pattern to localize the sensors. In this approach, we guarantee localization of all sensors within $r/2$ error-bound where $r$ is the communication range of the mobile anchor and sensors. Our simulation results support theoretical results along with localization accuracy.

Motivation & Objective

• To reduce the path length of mobile anchors in range-free localization while maintaining high accuracy.
• To design a distributed, connectivity-based path planning strategy that localizes all sensors in a connected network without prior knowledge of network boundaries.
• To develop a boundary-aware path planning scheme for a bounded rectangular region using hexagonal movement to ensure complete coverage and localization.
• To minimize the number of beacon points required per sensor from three to two, improving efficiency.
• To theoretically and empirically validate path length reduction and localization accuracy improvements over existing methods.

Proposed method

• Uses a hexagonal movement pattern for the mobile anchor to systematically cover the network region or traverse connected components.
• Employs connectivity information (neighbor relationships) to guide anchor movement in a connected network, localizing sensors incrementally.
• Applies geometric constraints from two beacon points (instead of three) using the localization scheme by Lee et al. [10] to improve efficiency.
• In bounded regions, the anchor follows a hexagonal path based on known rectangular boundaries, ensuring full coverage.
• Theoretical analysis derives path length as a function of communication range r and beacon distance u, with u = r/k and k > 7.5.
• Simulations validate path length and localization error across varying sensor counts, communication ranges, and beacon distances.

Experimental results

Research questions

• RQ1 Can a mobile anchor achieve complete localization of all sensors in a connected network using only connectivity information and a distributed strategy?
• RQ2 How does the proposed hexagonal path planning reduce path length compared to existing schemes in bounded rectangular regions?
• RQ3 What is the theoretical and empirical localization error bound when using two beacon points instead of three?
• RQ4 To what extent does reducing beacon distance u improve localization accuracy while maintaining path efficiency?
• RQ5 How does path length scale with increasing sensor density in a fixed region under the proposed strategy?

Key findings

• The proposed path planning reduces path length by 13.45% to 25.35% on average compared to existing schemes like Hilbert, Circles, and S-curves in bounded rectangular regions.
• Localization error decreases with smaller beacon distance u; for r=10m and u=r/30, error drops to 0.46m.
• Path length increases only slightly with sensor count in a fixed region (e.g., from 1490m for 100 sensors to 1754m for 300 sensors), indicating scalability.
• Theoretical analysis confirms that the proposed path length is shorter than existing methods for covering a rectangular region.
• In connected networks, the anchor localizes all sensors within r/2 error bound using only two beacon points and connectivity information.
• Simulation results closely match theoretical predictions, validating both path length and localization accuracy improvements.