Skip to content
Open access

Control Signaling Constrained Topology Reconfiguration for Clustered Wireless Sensor Networks

2026 · IEEE Access · Vol 14, pp. 117182-117192 · 0 citations · 28 references
Computer Science

TL;DR

Calibrated threshold rules can achieve longer LND after deployment-specific tuning, whereas the proposed controller provides a threshold-independent online control layer with quantified reliability-energy-delay trade-offs.

Abstract

In clustered wireless sensor networks (WSNs), battery-powered sensor nodes (SNs) deliver sensing packets to a base station (BS) through cluster heads (CHs), local aggregation, and multihop forwarding. Once a clustered topology is formed, residual energy, relay burden, and CH load diverge across nodes. Rebuilding the topology can rebalance this burden, but each rebuild also consumes control signaling energy for status reporting and configuration dissemination. This paper formulates clustered-WSN topology reconfiguration as a control-signaling-constrained online decision problem. The clustering and routing module serves as the topology-construction layer, while a semi-Markov decision process (SMDP) controller decides whether to keep the current topology or rebuild it with a selected cluster ratio. The controller is implemented using proximal policy optimization (PPO) with normalized energy descriptors, topology age, load-dependent imbalance, distance-dependent control overhead, and scalable cluster-ratio actions. Per-node energy conservation is audited so that data energy, control energy, idle energy, residual energy, and terminal clipping remain consistent with the initial network energy budget. In 30 energy-audited runs of 12,000 rounds, the proposed controller obtains first node death (FND) $1187.5\pm 168.3$ , half node death (HND) $1856.7\pm 25.9$ , packet delivery ratio (PDR) 0.9887, control energy 0.840 J, and 3566.7 delivered packets per Joule. Compared with a $T_{p}=10$ periodic baseline, it improves FND by 294.7 rounds and HND by 118.5 rounds, reduces control energy by 0.224 J, and increases delivered packets per Joule by 213.9. The trade-off is a 86.7-round reduction in last node death (LND) and higher delay under the PEGASIS-style chain-routing module. Calibrated threshold rules can achieve longer LND after deployment-specific tuning, whereas the proposed controller provides a threshold-independent online control layer with quantified reliability-energy-delay trade-offs.

Read PDF

Similar papers

Open access Aug 2026

EARDC: Energy-Aware Reaction–Diffusion-Based Clustering for Area Coverage in Wireless Sensor Networks

Energy-efficient clustering extends the lifetime of wireless sensor networks (WSNs). Conventional protocols such as LEACH and HEED primarily address communication energy and cluster head (CH) selection rather than area coverage under random deployment. C3 considers coverage and redundancy without node coordinates; howe...

Shu-Yuan Wu, T. Brown · 0 citations
Open access Aug 2026

LEACH-G: Local-Support-Aware Sequentially Inhibited Cluster-Head Election for Energy-Efficient Wireless Sensor Networks

Wireless sensor networks (WSNs) are frequently deployed in unattended environments where battery replacement is difficult. Low-Energy Adaptive Clustering Hierarchy (LEACH) reduces redundant transmissions through clustering and cluster-head rotation, but its cluster-head election remains highly random and can select low...

Zexuan Wei · 0 citations
Open access Sep 2026

Simple Compressive Data Gathering Model for Wireless Sensor Network- Based Medical Internet of Things Applications

A simple, practical CDG-based clustered routing model specifically designed for WSN-based MIoT applications that extends network lifetime by up to 38% compared to the state-of-the-art adaptive clustering approach, and its simplicity and energy efficiency make it well-suited for real-world MIoT deployments.

Mohammad Reza Ghaderi · 0 citations
Open access Aug 2026

A distributed K-means-based improved energy distance LEACH routing protocol for wireless sensor networks

A distributed K-means clustering algorithm integrated with a modified low energy adaptive clustering hierarchy-improved energy distance protocol for clustering and CH selection achieves improved network lifetime, energy balancing, and scalability while maintaining competitive throughput performance compared with existi...

M. Arafat, M. Drieberg, A. A. Aziz et al. · 0 citations
Open access Aug 2026

THGCDTR-RP: A triple-hybrid swarm intelligence and tree-based routing protocol for energy-efficient wireless sensor networks

ThGCDTR-RP is proposed, an energy-efficient clustering and routing protocol that integrates Grey Wolf Optimizer, Cheetah Optimizer, and Differential Evolution for cluster-head (CH) selection that consistently outperforms LEACH, LPSO, LGWO, WOA-P, and LACO.

Xuan Yang, Jia-Qi Yan, De-Sheng Wang et al. · 0 citations
Open access Aug 2026

Energy-Aware Cluster-Optimized Intelligent Routing Protocol for WSN-based IoT Networks

Wireless Sensor Networks (WSNs) use resource-constrained sensor nodes to continuously monitor ambient conditions and serve as data sinks for various Internet of Things (IoT) applications. However, maximizing Energy Efficiency (EE) while maintaining reliable data delivery remains a significant challenge. Existing cluste...

P. Kumbhar, A. Naik · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.