Evidence map›Paper›PMID 40573507›Full record

ArticleSensors (Basel, Switzerland)2025

Sensor Node Deployment Optimization for Continuous Coverage in WSNs.

Haris Muhammad, Haewoon Nam

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2025. 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

2 authors.

Haris MuhammadDepartment of Electrical Engineering, Hanyang University, Ansan 15588, Republic of Korea.ORCID 0009-0001-5706-0800
Haewoon NamDepartment of Electrical Engineering, Hanyang University, Ansan 15588, Republic of Korea.ORCID 0000-0001-9847-7023

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Optimizing sensor node coverage remains a central challenge in wireless sensor networks (WSNs), where premature convergence and suboptimal solutions in traditional optimization methods often lead to coverage gaps and uneven node distribution. To address these issues, this paper presents a novel velocity-scaled adaptive search factor particle swarm optimization (VASF-PSO) algorithm that integrates dynamic mechanisms to enhance population diversity, guide the search process more effectively, and reduce uncovered areas. The proposed algorithm is evaluated through extensive simulations across multiple WSN deployment scenarios with varying node densities, sensing ranges, and monitoring area sizes. Comparative results demonstrate that the approach consistently outperforms several widely used metaheuristic algorithms, achieving faster convergence, better global exploration, and significantly improved coverage performance. On average, the proposed method yields up to 14.71% higher coverage rates than baseline techniques. These findings underscore the algorithm's robustness and suitability for efficient and scalable WSN deployments.

Indexed as

adaptive search factorDelaunay triangulationfast convergenceparticle swarm optimization (PSO)wireless sensor network

Identifiers

PMID40573507
PMCPMC12196809

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.