A Comparative Analysis of Distance-based Node Localization in Wireless Sensor Network

Shilpi, Shilpi; Gautam, Prateek Raj; Kumar, Sunil; Kumar, Arvind

doi:10.1109/spin52536.2021.9566136

Cited by 6 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The anisotropic WSNs suffer from localization problems, and these networks are utilized in real-life applications [10]. The localization algorithms designed to solve anisotropic WSNs localization problems are generally based on hop-based range free distance measurement [11] method and multilateration approach of location calculation [11,12].…”

Section: Introductionmentioning

confidence: 99%

A localization algorithm using reliable anchor pair selection and Jaya algorithm for wireless sensor networks

Chakraborty

Kumar

2023

Telecommun Syst

Self Cite

View full text Add to dashboard Cite

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.

show abstract