Distributed wireless sensor node localization based on penguin search optimization

Authors: MD AL SHAYOKH, SOO YOUNG SHIN

Abstract: Wireless sensor networks (WSNs) have become popular for sensing areas-of-interest and performing assigned tasks based on information on the location of sensor devices. Localization in WSNs is aimed at designating distinct geographical information to the inordinate nodes within a search area. Biologically inspired algorithms are being applied extensively in WSN localization to determine inordinate nodes more precisely while consuming minimal computation time. An optimization algorithm belonging to the metaheuristic class and named penguin search optimization (PeSOA) is presented in this paper. It utilizes the hunting approaches in a collaborative manner to determine the inordinate nodes within an area of interest. Subsequently, the proposed algorithm is compared with four popular algorithms, namely particle swarm optimization (PSO), binary particle swarm optimization (BPSO), bat algorithm (BA), and cuckoo search algorithm (CS). The comparison is based on two performance metrics: localization accuracy and computation time to determine inordinate nodes. The results obtained from the simulation illustrate that PeSOA outperforms the other algorithms, achieving an accuracy higher than 30%. In terms of computation time to determine inordinate nodes, the proposed algorithm requires 28% less time (on average) than the other algorithms do.

Keywords: Wireless sensor networks, localization, Penguin search algorithm, optimization, computation time

Full Text: PDF