A localization algorithm using Reliable Anchor Pair selection and Jaya Algorithm for Wireless Sensor Networks
preprint
OA: closed
Abstract
Abstract A node localization algorithm using the Jaya algorithm (JA) and range-free method of reliable anchor pair (RAP) selection approach is proposed to determine the position of target nodes or unknown devices in isotropic, O-shaped, and S-shaped anisotropic wireless sensor networks (WSNs). The reliable anchor selection method separates anchor nodes into prime anchor node pairs, subprime anchor node pairs, and unreachable anchor node pairs to determine the distance between anchor node pairs and target nodes. The nature-inspired Jaya algorithm is used to predict the position of the target node. The presented work is compared with the existing localization methods, including DV(Distance Vector)maxHop, PSO (Particle Swarm Optimization), and QSSA (Quantized Salp Swarm Algorithm) based localization algorithms. The proposed approach increases localization accuracy regarding the number of anchor nodes and node density. The proposed algorithm also looks at how the degree of irregularity and computation time affect the performance.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00