Path planning is an important issue for localization with mobile anchor in wireless sensor networks as movement of the mobile anchor consumes more energy compared to static anchor. Most of the works available in the literature either looks into the aspect of reducing path length of the mobile anchor or tries to increase localization accuracy. In this paper we propose a cost-effective movement strategy i.e., path planning for a mobile anchor which reduces path length and at the same time localization can be done using localization scheme [3], which yields good accuracy. Simulation results show improvement over existing work [4] in terms of both path length and localization accuracy.
CITATION STYLE
Mondal, K., Karmakar, A., & Mandal, P. S. (2015). Path planning algorithm for mobile anchor in connected sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8956, pp. 193–198). Springer Verlag. https://doi.org/10.1007/978-3-319-14977-6_14
Mendeley helps you to discover research relevant for your work.