Wireless Sensor Network Localization Problem by Hybridized Moth Search Algorithm

Abstract

Wireless sensor networks are widely used and consequently represent an important research field. The objective of the node localization problem, that belongs to the group of NP-hard tasks, is to find geographical coordinates of each sensor node with unknown position that are randomly deployed in the monitoring area. Such hard optimization problems are successfully solved by the swarm intelligence algorithms. This paper presents hybridized recent swarm intelligence moth search algorithm adapted for solving localization problem in wireless sensor networks. The application of the moth search algorithm for node localization problem was not found in the literature survey. In the experimental section of this paper we show comparative analysis between the original and hybridized moth search algorithm, as well as with other state-of-the-art algorithms that were tested on the same problem instances of node localization problem. According to experimental results, both, basic moth search and hybridized moth search algorithms are promising approaches for dealing with this kind of problem.