Evidence map›Paper›PMID 41545525›Full record

ArticleScientific reports2026

QPSODRL: an improved quantum particle swarm optimization and deep reinforcement learning based intelligent clustering and routing protocol for wireless sensor networks.

Liu Guangjie

Abstract read
In one paragraph

Article in Scientific reports, 2026. 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

1 author.

Liu GuangjieCollege of Computer Science and Technology, Changchun Normal University, Changchun, 130032, China. Liugj2024@163.com.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In wireless sensor networks (WSNs), energy-efficient clustering and adaptive routing are key to extending network lifetime and ensuring reliable communication under dynamic conditions. Although numerous metaheuristic- and learning-based schemes have been developed to address these challenges, existing methods may suffer from premature convergence, imbalanced energy utilization, and limited generalization capability when network conditions vary, which restricts their long-term effectiveness. To address these limitations, an intelligent clustering and routing protocol called QPSODRL (Quantum Particle Swarm Optimization and Deep Reinforcement Learning), that integrates an enhanced Quantum Particle Swarm Optimization (QPSO) and Deep Reinforcement Learning (DRL), is proposed in this paper. In the clustering phase based on QPSO, an entropy-guided activation strategy is introduced to dynamically switch between global exploration and local exploitation, based on the network's energy distribution entropy. Additionally, an elite-guided quantum perturbation mechanism is adopted to drive particles toward promising regions while maintaining diversity, significantly improving convergence quality. In the routing phase, a modified Dueling Double Deep Q-Network (D3QN) is extended with an advantage entropy regularization term, which encourages policy diversity and avoids overfitting, thereby increasing robustness against topology variations. Furthermore, an Enhanced Prioritized Experience Replay (E-PER) strategy is integrated to adjust sampling priorities based on temporal-difference errors, residual energy, and communication cost, accelerating policy convergence in energy-constrained environments. Extensive simulation results demonstrate that QPSODRL outperforms four state-of-the-art protocols in terms of network lifetime, load balancing, throughput, and energy consumption, validating its superiority in optimization accuracy, learning efficiency, and environmental adaptability.

Indexed as

Clustering and routing protocolDueling double deep q-networkEnhanced prioritized experience replay.Quantum particle swarm optimizationWireless sensor network

Identifiers

PMID41545525
PMCPMC12886828

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.