ArticleSensors (Basel, Switzerland)2026
A Multi-Hop Cluster Routing Algorithm for Wireless Sensor Networks Targeting Narrow Space Monitoring.
Article in Sensors (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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.
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.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Wireless sensor networks (WSNs) are recognized as a promising enabling technology for health monitoring of elongated infrastructures such as bridges, tunnels and railways. However, the significant distribution span of WSN nodes within narrow spaces requires monitoring data to be transmitted to the base station via multi-hop routing, which poses higher demands on network energy efficiency and lifespan. This paper proposes a Multi-hop Cluster Routing Algorithm based on an Improved Sparrow Search Algorithm (ISSAMC) aimed at optimizing the optimal multi-hop path from cluster heads (CHs) to the base station, thereby extending the stability period and overall lifespan of WSNs in narrow spaces. The ISSAMC first employs a non-uniform clustering mechanism, taking into account the residual energy of nodes and the distance to the base station, to generate a CH distribution that aligns with the topological characteristics of the narrow structure. Next, a multi-objective fitness function is constructed to simultaneously minimize the total energy consumption of the CHs and the variance in energy consumption, along with a dynamic weight adjustment strategy to adapt to the time-varying characteristics of the network state. Finally, multi-hop path optimization is performed using an improved SSA that incorporates strategies such as population initialization based on Sobol sequences, discrete encoding and decoding mechanisms, and crossover techniques, resulting in high-quality multi-hop paths. Simulation results show that under the unified ideal simulation benchmark, compared with MH-LEACH, GAECH, BEBMCR and EBPSO algorithms, ISSAMC improves the network stability period by 231%, 94%, 60% and 49.5%, respectively, and extends the overall network lifetime by 55%, 31%, 25.5% and 24%, respectively.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.