1. Application of Jaya algorithm for solving localization problem in a distributed Wireless Sensor Network.
- Author
-
Shilpi and Kumar, Arvind
- Subjects
- *
WIRELESS sensor networks , *DISTRIBUTED sensors , *DISTRIBUTED algorithms , *PARTICLE swarm optimization , *PROBLEM solving , *ALGORITHMS - Abstract
Identifying the location of the sensor nodes is a challenging aspect of Wireless Sensor Networks (WSNs) in a distributed environment. It is vital to understand where data and events come from when sensor nodes collect data and report on them. This paper uses a nature-inspired Jaya algorithm to estimate the location coordinates of target nodes in a distributed architecture of WSNs. The Jaya algorithm handles the nonlinear optimization problem of node localization in a randomly distributed sensor node configuration. The range-based, Received Signal Strength Indicator method is used for the distance estimation. MATLAB software is used to assess the proposed work, and a comparison is made with the Particle Swarm Optimization, Krill Herd Optimization, and Salp Swarm Algorithm based node localization algorithms in terms of localization error and computation time. The localization error analysis is done for the different numbers of anchor nodes and different values of degree of irregularity to verify the effectiveness of the proposed work. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF