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

Shilpi () and Arvind Kumar ()
Additional contact information
Shilpi: Motilal Nehru National Institute of Technology Allahabad
Arvind Kumar: Motilal Nehru National Institute of Technology Allahabad

Telecommunication Systems: Modelling, Analysis, Design and Management, 2023, vol. 82, issue 2, No 6, 277-289

Abstract: Abstract In wireless sensor networks (WSNs) and large-scale IoT applications, node localization is a challenging process to identify the location of the target or unknown nodes for accurate information transmission between sensor nodes. Due to their ease of hardware implementation and suitability for large-scale WSNs, range-free localization techniques have been shown in previous studies. The existing range-free localization algorithms did not consider the anisotropy factors typically seen in WSNs, leading to poor positioning accuracy. We proposed a range-free localization solution that combines the benefits of geometric constraint and hop progress-based approaches to address this issue. Each unknown node categorizes the anchor node pairs into one of three proposed categories, and the discriminating conditions are designed using the geometric information provided by the combination of the anchor node pairs and unknown nodes. A node localization algorithm is proposed to determine the position of target nodes or unknown nodes and to reduce the effect of anisotropic factors in isotropic, O-shaped, and S-shaped anisotropic WSNs using the parameter-less Jaya algorithm (JA) and range-free method of reliable anchor pair (RAP) selection approach. In the case of anisotropic WSNs (AWSNs), finding the location of target nodes is more complicated. The presented work is compared with the existing node localization methods, including Distance Vector (DV)-maxHop, Particle Swarm Optimization (PSO), and Quantized Salp Swarm Algorithm (QSSA) based localization algorithms. The proposed approach provides improved localization accuracy compared to the existing node localization methods 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.

Keywords: Anisotropic; Isotropic; Jaya; Localization; PSO; QSSA; Wireless sensor networks (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11235-022-00984-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:telsys:v:82:y:2023:i:2:d:10.1007_s11235-022-00984-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11235

DOI: 10.1007/s11235-022-00984-1

Access Statistics for this article

Telecommunication Systems: Modelling, Analysis, Design and Management is currently edited by Muhammad Khan

More articles in Telecommunication Systems: Modelling, Analysis, Design and Management from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().