Evidence map›Paper›PMID 41254000›Full record

ArticleScientific reports2025

An energy aware routing protocol using mayfly optimization (ERPMO) and TDMA scheduling in wireless sensor networks.

B Sinduja, C Yaashuwanth, K Prathibanandhi, S Ramesh

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

4 authors.

B SindujaDepartment of Information Technology, Sri Venkateswara College of Engineering, Sriperumbudur, Chennai, Tamil Nadu, India. sindu222it@gmail.com.
C YaashuwanthDepartment of Information Technology, Sri Venkateswara College of Engineering, Sriperumbudur, Chennai, Tamil Nadu, India.
K PrathibanandhiDepartment of Electrical and Electronics Engineering, Sri Sairam Engineering College, Chennai, Tamil Nadu, India.
S RameshDepartment of Artificial Intelligence and Data Science, AKT Memorial College of Engineering & Technology, Kallakurichi, Tamil Nadu, India.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Wireless Sensor Networks (WSNs) play a crucial role in data collection from distributed and resource-constrained environments. However, the limited energy capacity of sensor nodes remains a significant challenge to sustaining long-term operations. To address this, a novel Energy-Aware Routing Protocol using Mayfly Optimization (ERPMO) integrated with K-means clustering and TDMA-based scheduling is proposed. The model employs K-means for spatially efficient cluster formation, while the Mayfly Optimization Algorithm (MOA) selects optimal cluster heads (CHs) based on key parameters such as residual energy, distance to base station, energy consumption rate, and node density. Additionally, sub-clusters are dynamically formed to balance transmission load, and TDMA allocates time slots to minimize interference and collisions. Simulation results show that ERPMO achieves a network lifetime of 1285 rounds, packet delivery ratio of 96.3%, residual energy of 0.32 J, cluster head selection accuracy of 91.2%, and a fairness index of 0.79, outperforming existing LEACH, PSO, and GA-based protocols. The proposed ERPMO model provides a compact, energy-efficient, and collision-free routing framework for sustainable WSN operation.

Indexed as

Cluster Head selectionEnergy efficient routingMayfly optimizationTDMA schedulingWireless Sensor Networks (WSN)

Identifiers

PMID41254000
PMCPMC12627611

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
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.