Hide/Show Apps

Path Planning and Localization for Mobile Anchor Based Wireless Sensor Networks

2017-09-02
Erdemir, Ecenaz
Tuncer, Temel Engin
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
3
views
0
downloads
In wireless sensor networks, anchor positions play an important role for accurate localization. For mobile anchor ( MA) based scenarios, both the efficiency of the path planning algorithm and the accuracy of the localization mechanism are critical for the best performance. In this work, an adaptive path planning algorithm is proposed based on Gauss-Markov mobility model, while the sensors are localized using alternating minimization approach. Path planning, which combines the velocity adjustment, the perpendicular bisector and the virtual repulsive strategies, is improved by developing virtual attractive force strategy. The surveillance area is divided into grids and a virtual attractive force is applied to the MA in sparsely and densely populated areas. For localization, the non-convex optimization problem is converted into a bi-convex form and solved by alternating minimization algorithm leading to a shorter MA path. The simulation results show that introducing the virtual attractive strategy increases the path planning accuracy and cover more surveillance region using less energy. Furthermore, compared to the linear localization method, the localization accuracy increases when the alternating minimization is used.
Dynamic path planning, Mobility model, Mobile-anchor, Sensor network localization, Alternating minimization
https://hdl.handle.net/11511/55477
Department of Electrical and Electronics Engineering, Conference / Seminar
METU IIS - Integrated Information Service IT Support Service
You can transmit your request, problems about services
provided by METU Computer Center, and follow the process.