Memetic Chains for Improving the Local Wireless Sensor Networks Localization in Urban Scenarios

• Main Authors: Paula Verde, Javier Díez-González, Rubén Ferrero-Guillén, Alberto Martínez-Gutiérrez, Hilde Perez
• Format: Article
• Language: English
• Published: MDPI AG 2021-04-01
• Series: Sensors
• Subjects: Cramèr-Rao Bound; local positioning system; memetic algorithm chains; node location problem; time difference of arrival; variable neighborhood descent
• Online Access: https://www.mdpi.com/1424-8220/21/7/2458

Local Positioning Systems (LPS) have become an active field of research in the last few years. Their application in harsh environments for high-demanded accuracy applications is allowing the development of technological activities such as autonomous navigation, indoor localization, or low-level flights in restricted environments. LPS consists of ad-hoc deployments of sensors which meets the design requirements of each activity. Among LPS, those based on temporal measurements are attracting higher interest due to their trade-off among accuracy, robustness, availability, and costs. The Time Difference of Arrival (TDOA) is extended in the literature for LPS applications and consequently we perform, in this paper, an analysis of the optimal sensor deployment of this architecture for achieving practical results. This is known as the Node Location Problem (NLP) and has been categorized as NP-Hard. Therefore, heuristic solutions such as Genetic Algorithms (GA) or Memetic Algorithms (MA) have been applied in the literature for the NLP. In this paper, we introduce an adaptation of the so-called MA-Solis Wets-Chains (MA-SW-Chains) for its application in the large-scale discrete discontinuous optimization of the NLP in urban scenarios. Our proposed algorithm MA-Variable Neighborhood Descent-Chains (MA-VND-Chains) outperforms the GA and the MA of previous proposals for the NLP, improving the accuracy achieved by 17% and by 10% respectively for the TDOA architecture in the urban scenario introduced.