An efficient DVHOP localization algorithm based on simulated annealing for wireless sensor network

Abstrak

In the last decade, the research community has devoted significant attention to wireless sensor networks (WSNs) because they contribute positively to some critical issues encountered in nature and even in industry. On the other hand, localization is one of the most important parts of WSN. Hence, the conception of an efficient method of localization has become a hot research topic. Lastly, it has been invented, a set of optimal positioning methods that make locate a node with low cost and give precise results. In our contribution, we investigate the source of imprecision in the distance vectorhop (DVHOP) localization algorithm. However, we found the last step of DVHOP caused an imprecision in the calculation. Consequently, our work was to replace this step, aiming to reach satisfactory precision. For that purpose, we created three improved versions of this algorithm by adopting two meta-heuristic (simulated annealing, particle swarm optimization) and Fmincon solver dedicated to optimization in the field of WSN node localization. The experimental results obtained in this work prove the efficiency of simulated annealing (SA)-DVHOP in terms of accuracy. Furthermore, the enhanced algorithm outperforms its opponents by varying the percentage of anchors and the number of nodes.