A Cluster Head Selection Algorithm for Extending Last Node Lifetime in Wireless Sensor Networks

This paper introduces a new cluster head selection algorithm for wireless sensor networks (WSNs) to maximize the time until the last sensor node depletes its energy. The algorithm is based on a formal analysis in which network lifetime is modeled as a function of node energy consumption. In contrast to existing energy-balancing strategies, this analytical foundation leads to a distinctive selection rule that prioritizes the node with the highest transmission probability and the lowest initial energy as the initial cluster head. The algorithm employs distributed per-cluster computation, enabling scalability without increasing complexity relative to network size. Unlike traditional approaches that rotate cluster heads based on time or equal energy use, our method adapts to heterogeneous energy consumption patterns and enforces a cluster head rotation order that maximizes the lifetime of the final active node. To validate the effectiveness of the proposed approach, we implement it on a real-world LoRaWAN-based sensor network prototype. Experimental results demonstrate that our method significantly extends the lifetime of the last active node compared to representative state-of-the-art algorithms. This research provides a practical and robust solution for energy-efficient WSN operation in real deployment scenarios by considering realistic and application-driven communication behavior along with hardware-level energy consumption.