Node Localization in Wireless Sensor Networks Based on Quantum Annealing Algorithm and Edge Computing
Yong Cao, Youjie Zhao, Fei Dai · 2019
Edge computing is a distributed computing paradigm in which computation is largely or completely performed on distributed device nodes. It can be applied in node localization in wireless sensor networks. Classical simulated annealing (SA) and genetic algorithm (GA) are widely used in non-ranging localization of wireless sensor network nodes (WSNN). However, they both have many problems, including 1) easy to fall into local optimum, difficult to achieve global optimum and low localization accuracy; 2) complicated calculation and high energy consumption, etc. In this study, a localization method for WSNN based on quantum annealing (QA) algorithm was proposed by using quantum tunneling effect, in which the energy barrier can be quickly penetrated from local optimum to global optimum, so that the calculation is simplified and the computation speed is increased. The simulation results demonstrated that the proposed algorithm improves the precision and reduces the energy consumption compared with the traditional GA and the classical SA algorithm, making it have wider application prospects.