Metaheuristic RSSI based for node localization in distributed wireless sensor network

Recently wireless sensor localization (WSN) has become very active research domain due to its large application where processes have to be spread over a large area. One of the several technical aspects of WSNs is the node localization, the main task of nodes localization is to find out the coordinates of the nodes in a short time with a minimum of energy. The recent trend is based on metaheuristic to result this problem where Node localization is treated as an optimization problem and many approaches are proposed. Once of recent algorithms is Bat Algorithm who is based on sending pulses and locating prey via receiving echolocation. The features of Bat have made the algorithm popular and give more efficiency in literature, the most research of node localization is addressed to treat only localization error. In this paper, the multi-criteria problem is treated and evaluated (localization (error/ time)) of the original Bat algorithm, the obtained result is presented as a comparative study among Bat algorithm, Particle Swarm Optimization, and differential evolution.