Evidence map›Paper›PMID 41062484›Full record

ArticleScientific reports2025

Smart pareto-optimized genetic algorithm for energy-efficient clustering and routing in wireless sensor networks.

M Rajalakshmi, S Ponni Alias Sathya

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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.

M RajalakshmiDepartment of Artificial Intelligence and Data Science, Dr. Mahalingam College of Engineering and Technology, Pollachi, Tamilnadu, India. rajalakshmi.res89@gmail.com.
S Ponni Alias SathyaDepartment of Information Technology, Dr. Mahalingam College of Engineering and Technology, Pollachi, Tamilnadu, India.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Healthcare, business, and the military employ wireless sensor networks (WSNs). Unfortunately, these networks have power supply, storage, and computing restrictions for sensor nodes. To overcome these difficulties, enhance energy efficiency, and extend network lifetime, we present a novel Pareto-based Genetic Algorithm for Energy-Efficient Clustering and Routing (PGAECR). It incorporates the best results from earlier networking sessions into the starting population for the present rounds, improving convergence speed and solution quality in the search process. The technique combines decisions about clustering and routing into one chromosome. A multi-objective fitness function that takes into account total energy consumption, residual energy balance, load distribution, and network longevity evaluates it. The first group comprises the best-performing solutions from the past, designed to aid convergence and enhance solution quality. An experimental examination examines factors such as transmission energy (ET, ER), data packet length, amplifier energy models (Efs, Emp), communication range, and node density across different network conditions. Experimental results indicate that PGAECR outperforms five other methods, demonstrating superior load balancing with minimal variance in cluster head loads across various scenarios. The proposed algorithm reduced energy usage by 12.4% and increased network longevity by 15.7% compared to conventional clustering and routing methods.

Indexed as

ClusteringEnergy efficiencyGenetic algorithmLoad balancingNetwork lifespan optimizationRoutingSensor networks

Identifiers

PMID41062484
PMCPMC12508445

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.