By Topic

Path Planning Algorithm for Mobile Anchor-Based Localization in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chia-Ho Ou ; Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada ; Wei-Lun He

Localization is an essential issue in wireless sensor networks because many applications require the sensor nodes to know their locations with a high degree of precision. Various localization methods based on mobile anchor nodes have been proposed for assisting the sensor nodes to determine their locations. However, none of these methods attempt to optimize the trajectory of the mobile anchor node. Accordingly, this paper presents a path planning scheme, which ensures that the trajectory of the mobile anchor node minimizes the localization error and guarantees that all of the sensor nodes can determine their locations. The obstacle-resistant trajectory is also proposed to handle the obstacles in the sensing field. The performance of the proposed scheme is evaluated through a series of simulations with the ns-2 network simulator. The results show that the proposed path planning algorithm yields both a lower localization error and a higher percentage of localized sensor nodes than existing path planning schemes.

Published in:

IEEE Sensors Journal  (Volume:13 ,  Issue: 2 )