Evidence map›Paper›PMID 39123837›Full record

ArticleSensors (Basel, Switzerland)2024

Node Localization Method in Wireless Sensor Networks Using Combined Crow Search and the Weighted Centroid Method.

Suresh Sankaranarayanan, Rajaram Vijayakumar, Srividhya Swaminathan, Badar Almarri, Pascal Lorenz, Joel J P C Rodrigues

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Suresh SankaranarayananDepartment of Computer Science, King Faisal University, Al Hofuf P.O. Box 400, Saudi Arabia.
Rajaram VijayakumarDepartment of Networking and Communications, School of Computing, SRM Institute of Science and Technology, Chennai 603203, India.
Srividhya SwaminathanDepartment of Data Science and Business Systems, School of Computing, Faculty of Engineering and Technology, SRM Institute of Science and Technology, Kattankulathur, Chennai 603203, India.ORCID 0000-0002-7827-6045
Badar AlmarriDepartment of Computer Science, King Faisal University, Al Hofuf P.O. Box 400, Saudi Arabia.
Pascal LorenzInstitute de Recherche en Informatique, Mathématique, Mathématiques, Automatique et Signal, University of Haute Alsace, 68100 Colmar, France.ORCID 0000-0003-3346-7216
Joel J P C RodriguesHigher School of Technology, Amazonas State University, Manaus 69050-020, AM, Brazil.ORCID 0000-0001-8657-3800

Funding

Brazilian National Council for Scientific and Technological Development-CNPq No. 306607/2023-9Deanship of Scientific Research, Vice Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia No. KFU241353
6 · The paper itself

Abstract

Node localization is critical for accessing diverse nodes that provide services in remote places. Single-anchor localization techniques suffer co-linearity, performing poorly. The reliable multiple anchor node selection method is computationally intensive and requires a lot of processing power and time to identify suitable anchor nodes. Node localization in wireless sensor networks (WSNs) is challenging due to the number and placement of anchors, as well as their communication capabilities. These senor nodes possess limited energy resources, which is a big concern in localization. In addition to convention optimization in WSNs, researchers have employed nature-inspired algorithms to localize unknown nodes in WSN. However, these methods take longer, require lots of processing power, and have higher localization error, with a greater number of beacon nodes and sensitivity to parameter selection affecting localization. This research employed a nature-inspired crow search algorithm (an improvement over other nature-inspired algorithms) for selecting the suitable number of anchor nodes from the population, reducing errors in localizing unknown nodes. Additionally, the weighted centroid method was proposed for identifying the exact location of an unknown node. This made the crow search weighted centroid localization (CS-WCL) algorithm a more trustworthy and efficient method for node localization in WSNs, with reduced average localization error (ALE) and energy consumption. CS-WCL outperformed WCL and distance vector (DV)-Hop, with a reduced ALE of 15% (from 32%) and varying communication radii from 20 m to 45 m. Also, the ALE against scalability was validated for CS-WCL against WCL and DV-Hop for a varying number of beacon nodes (from 3 to 2), reducing ALE to 2.59% (from 28.75%). Lastly, CS-WCL resulted in reduced energy consumption (from 120 mJ to 45 mJ) for varying network nodes from 30 to 300 against WCL and DV-Hop. Thus, CS-WCL outperformed other nature-inspired algorithms in node localization. These have been validated using MATLAB 2022b.

Indexed as

anchor nodescrow search algorithmlocalizationrange free

Identifiers

PMID39123837
PMCPMC11314908

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.