On optimal anchor placement for area‐based localisation in wireless sensor networks
Open Access
- 7 February 2021
- journal article
- research article
- Published by Institution of Engineering and Technology (IET) in IET Wireless Sensor Systems
- Vol. 11 (2) , 67-77
Abstract
We consider the problem of optimal anchor placement for area‐based localisation algorithms with the goal of providing cost‐effective, simple, and robust positioning in wireless sensor networks. Due to the high complexity of the problem, we propose two placement algorithms based on heuristics. The first, called genetic algorithm anchors placement (GAAP), is based on genetic algorithms meta‐heuristic, and the second, called local search anchors placement (LSAP), is based on an intuitive heuristic inspired from search techniques used in quad‐trees. For the evaluation of these algorithms, we built a simulation framework, which we made publicly available for the community, and compared their performance against a Brute force (BF) algorithm, and against RND, a random walk‐inspired algorithm. Obtained results show that GAAP provides anchor placements that lead to a very high accuracy while keeping execution time drastically smaller compared to LSAP, BF, and RND.Keywords
This publication has 18 references indexed in Scilit:
- Tabu Search2016
- On the optimal anchor placement in single-hop sensor localizationWireless Networks, 2016
- On optimal anchor placement for efficient area-based localization in wireless networks2015
- An Effective Area-Based Localization Algorithm for Wireless NetworksIEEE Transactions on Computers, 2014
- Exploration and exploitation in evolutionary algorithmsACM Computing Surveys, 2013
- On the minimum number of active anchors for optimal localization2012
- Half-Symmetric Lens based localization algorithm for wireless sensor networks2012
- Anchor nodes placement for effective passive localization2011
- Range-free sensor localisation with ring overlapping based on comparison of received signal strength indicatorInternational Journal of Sensor Networks, 2007
- Metaheuristics in combinatorial optimizationACM Computing Surveys, 2003