Open AccessEfficient localisation approach for WSNs using hybrid DA–FA algorithm
Author(s) -
Singh Prabhjot,
Mittal Nitin
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2019.1311
Subject(s) - computer science , firefly algorithm , wireless sensor network , benchmark (surveying) , algorithm , node (physics) , exploit , field (mathematics) , real time computing , computer network , mathematics , particle swarm optimization , computer security , geodesy , structural engineering , pure mathematics , engineering , geography
Localisation has become a major attraction of research in recent years in the field of wireless sensor networks (WSNs). It is required for various applications like monitoring of objects placed in indoors and outdoors environments. The main requirement in localisation is to assign a location to each node, since multiple sensor nodes in WSN are used to retrieve information. The aim of this research is to address a WSN localisation problem using various optimisation techniques. The concept of single anchor node placement at the centre of sensing field with its projection using hexagonal pattern is introduced. In this study, a novel hybrid optimisation technique named as dragonfly–firefly algorithm (DA–FA) is proposed. DA is an optimisation algorithm recently suggested based on the dragonfly's static and dynamic swarming behaviour. The suggested hybrid technique combines the exploration capability of explore DA and Firefly algorithm's to exploit to obtain ideal global solutions. To check the effectiveness of DA–FA CEC 2019 benchmark functions are used for comparison with competitive algorithms. DA–FA converges fast and provide optimum solution for most of the benchmark functions. In addition, DA–FA outperforms well in terms of localisation error in comparison to existing localisation solutions.