The study, published in Frontiers in Communications and Networks, introduces XEACH, short for eXplainable Energy-Aware Clustering Hierarchy. Its target is one of the most consequential control problems in the Internet of Things: cluster head selection. In hierarchical wireless sensor networks, ordinary nodes do not transmit their data directly to a distant base station, an approach whose energy cost balloons with distance. Instead they organise into clusters, each led by an elected cluster head that aggregates local readings and performs the single expensive long-haul transmission. Because the leadership role concentrates energy expenditure, the rule that decides who leads—and for how long—determines whether the network drains evenly or burns out in hotspots.

The classical answer, LEACH, dates back decades and simply rotates the burden randomly so that every node takes its turn in expectation. Refinements such as SEP and HEED weighted the rotation by residual energy and geometry, and a wave of recent work has handed the problem to reinforcement learning, in which each node learns from experience when serving as cluster head is worth the cost. These learned selectors adapt to changing conditions in ways fixed rules cannot. But the researchers identified three recurring failures that block real deployments: the learned policies are opaque black boxes unacceptable in mission-critical infrastructure, they are validated almost exclusively under unrealistically constant traffic, and they ignore the energy-harvesting devices that recharge from ambient sources and now populate genuine urban networks.

XEACH attacks all three weaknesses in a single design. The team first proved that even the single-round version of the selection problem—choosing the cluster head subset that minimises energy expenditure—is NP-hard, by reduction from the capacitated p-median problem. No exact solver can run on resource-constrained IoT hardware, let alone one that must be re-run every round. Instead of solving, XEACH learns. Each node is modelled as an agent in a Markov decision process whose state captures residual energy, distance to the base station, neighbourhood density, and the current traffic level, discretised into a compact set of categories. The elegance of this representation lies in what it enables: a policy can discover that a high-energy node far from the base station may be a worse leader than a slightly weaker node sitting close to it—a distinction a pure energy threshold can never make.

The reward structure is deliberately two-sided. A node that elects to serve and successfully shepherds its cluster earns a reward tied to its post-service energy, while a node that sensibly declines service when depleted also earns credit. This teaches low-energy nodes that conserving is valuable and well-placed, well-charged nodes that stepping up is valuable, so the learned advantage encodes a genuine cost–benefit judgement. In each round, every alive node bids its estimated advantage of serving, and the highest bidders are elected, with a per-round cluster head count provably bounded. The action values live in a shared table updated by Q-learning, and the authors prove convergence under standard stochastic-approximation conditions: with sufficient exploration and appropriately decaying learning rates, each agent’s values converge almost surely to the optimum of its induced decision problem.

Transparency comes from a post hoc module built on SHAP—SHapley Additive exPlanations. Every election is logged with the deciding node’s features and outcome, a lightweight surrogate classifier is trained offline to reproduce the decisions, and TreeSHAP attributes each choice additively to its contributing features. Crucially, the explanation machinery is fully decoupled from the control loop: cluster head election itself is a table lookup and a sort, so auditing adds no latency, radio traffic, or energy cost on the nodes. SHAP was chosen over alternatives such as LIME because its attributions are theoretically grounded and deterministic—exactly the reproducibility that safety-relevant control decisions demand. The surrogate reproduced the learned policy’s decisions with a fidelity of 0.87, and the resulting feature ranking is physically coherent: residual energy dominates, followed by distance to the base station, with neighbour density and traffic contributing less.

The evaluation is where the framework earns its headline numbers. Rather than the constant loads of most prior studies, the simulations model smart-city traffic as smooth diurnal congestion punctuated by rare, stochastic event spikes, with thirty percent of nodes harvesting ambient energy. Across networks of 50 to 300 nodes, XEACH consistently outlived LEACH, SEP, and HEED. At 100 nodes it extended first-node death—the moment the first battery dies—by 88 percent over LEACH, and the margin widened as networks grew, from roughly 68 percent at 50 nodes to nearly triple the LEACH figure at 300 nodes, suggesting the learned policy exploits the richer structure of larger deployments rather than degrading under contention.

The most striking demonstration that learning itself drives the gains came from an ablation. When the researchers replaced the trained policy with a random policy using identical selection mechanics, network lifetime collapsed by an order of magnitude: at 100 nodes, first-node death fell from 274 rounds to just 23. The team also grounded the simulation in physical reality by calibrating the radio energy model to the published datasheet of the Semtech SX1262, a current sub-GHz LoRa transceiver drawing 4.2 milliamperes in active receive and transmitting at up to +22 dBm from a 3.3-volt supply. Mapped onto a 0.5-joule per-node budget with one aggregation round per minute, the simulated energy regime corresponds to first-node death on the order of days to weeks for the baselines—proportionally longer for XEACH—consistent with real LoRa sensor-node lifetimes.

The authors are candid about limits. The work is simulation-based with a standard first-order radio model, and hardware validation on physical motes remains future work. The tabular learner trades representational capacity for constant-time updates and tractable explanation, the convergence guarantee applies per agent rather than to the full multi-agent system, and the advantage over HEED at 100 nodes falls within one standard deviation, widening only with scale. Still, the implications reach beyond energy. Because the policy already conditions on node resources, the researchers see it as the foundation for a cross-layer design in which the same state informs energy-aware federated intrusion detection, allocating security workload according to available power—and the explainability machinery transfers directly, in a domain where auditable AI is rapidly becoming a regulatory expectation rather than a luxury. For cities betting their sensing infrastructure on battery-powered nodes, a network that both survives longer and can justify its choices may prove the difference between a demo and a deployment.

Subject of Research: Explainable reinforcement learning for energy-aware cluster head selection in smart-city IoT wireless sensor networks

Article Title: An explainable reinforcement learning framework for energy-aware cluster head selection in smart-city IoT wireless sensor networks

Article References: C, N., & K, P. (2026). An explainable reinforcement learning framework for energy-aware cluster head selection in smart-city IoT wireless sensor networks. Frontiers in Communications and Networks, 7, Article 1923625. https://doi.org/10.3389/frcmn.2026.1923625

Image Credits: AI Generated

DOI: 10.3389/frcmn.2026.1923625

Keywords: wireless sensor networks, Internet of Things, reinforcement learning, explainable AI, SHAP, cluster head selection, energy harvesting, network lifetime, smart cities, LoRa, LEACH, NP-hardness