A Quantum Annealing Bat Algorithm for Node Localization in Wireless Sensor Networks
Shujie Yu, Jianping Zhu, Chunfeng Lv
Abstract
Node localization in two-dimensional (2D) and three-dimensional (3D) space for wireless sensor networks (WSNs) remains a hot research topic. To improve the localization accuracy and applicability, we first propose a quantum annealing bat algorithm (QABA) for node localization in WSNs. QABA incorporates quantum evolution and annealing strategy into the framework of the bat algorithm to improve local and global search capabilities, achieve search balance with the aid of tournament and natural selection, and finally converge to the best optimized value. Additionally, we use trilateral localization and geometric feature principles to design 2D (QABA-2D) and 3D (QABA-3D) node localization algorithms optimized with QABA, respectively. Simulation results show that, compared with other heuristic algorithms, the convergence speed and solution accuracy of QABA are greatly improved, with the highest average error of QABA-2D reduced by 90.35% and the lowest by 17.22%, and the highest average error of QABA-3D reduced by 75.26% and the lowest by 7.79%.