A Hybrid Metaheuristic Bat Algorithm with Simulated Annealing for Node Localization in Wireless Sensor Network

Authors

  • Mrs. T. Swarna Latha, Dr. K. Bhanu Rekha

DOI:

https://doi.org/10.17762/msea.v71i3.232

Abstract

Wireless Sensor Network has application laid its hands in various fields. Localization of nodes is the key technology of WSN. Among the various existing localization algorithms, Distance Vector Hop (DV-Hop) algorithm is the most commonly used localization algorithm.  Routing exchange protocol is used to make the beacon information available for the unknown nodes. The information is used for calculating the co-ordinates of the neighbor nodes. Hence, the algorithm for localization of nodes is always found to be associated with an error. Thus to overcome the error occurring in traditional node localization algorithm in Wireless Sensor Network, a novel metaheuristic BAT with Simulated Anhelaing is proposed in this paper.  The error in localization is significantly reduced and thereby increasing the overall performance of locating the nodes is improved. The simulation results prove the performance efficiency of the proposed novel metaheuristic algorithm for optimization of a WSN.

Downloads

Published

2022-06-09

How to Cite

Mrs. T. Swarna Latha, Dr. K. Bhanu Rekha. (2022). A Hybrid Metaheuristic Bat Algorithm with Simulated Annealing for Node Localization in Wireless Sensor Network. Mathematical Statistician and Engineering Applications, 71(3), 845 –. https://doi.org/10.17762/msea.v71i3.232

Issue

Section

Articles