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...

Full description

Saved in:
Bibliographic Details
Main Authors: Marcin Lewandowski, Bartłomiej Płaczek
Format: Article
Language:English
Published: MDPI AG 2025-05-01
Series:Sensors
Subjects:
Online Access:https://www.mdpi.com/1424-8220/25/11/3466
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849331019109367808
author Marcin Lewandowski
Bartłomiej Płaczek
author_facet Marcin Lewandowski
Bartłomiej Płaczek
author_sort Marcin Lewandowski
collection DOAJ
description 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.
format Article
id doaj-art-5ca7c29115ed44178b40aefb6064637e
institution Kabale University
issn 1424-8220
language English
publishDate 2025-05-01
publisher MDPI AG
record_format Article
series Sensors
spelling doaj-art-5ca7c29115ed44178b40aefb6064637e2025-08-20T03:46:45ZengMDPI AGSensors1424-82202025-05-012511346610.3390/s25113466A Cluster Head Selection Algorithm for Extending Last Node Lifetime in Wireless Sensor NetworksMarcin Lewandowski0Bartłomiej Płaczek1Institute of Computer Science, University of Silesia, Będzińska 39, 41-200 Sosnowiec, PolandInstitute of Computer Science, University of Silesia, Będzińska 39, 41-200 Sosnowiec, PolandThis 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.https://www.mdpi.com/1424-8220/25/11/3466wireless sensor networklifetime of sensor networkcluster head rotationtransmission reductioninternet of things
spellingShingle Marcin Lewandowski
Bartłomiej Płaczek
A Cluster Head Selection Algorithm for Extending Last Node Lifetime in Wireless Sensor Networks
Sensors
wireless sensor network
lifetime of sensor network
cluster head rotation
transmission reduction
internet of things
title A Cluster Head Selection Algorithm for Extending Last Node Lifetime in Wireless Sensor Networks
title_full A Cluster Head Selection Algorithm for Extending Last Node Lifetime in Wireless Sensor Networks
title_fullStr A Cluster Head Selection Algorithm for Extending Last Node Lifetime in Wireless Sensor Networks
title_full_unstemmed A Cluster Head Selection Algorithm for Extending Last Node Lifetime in Wireless Sensor Networks
title_short A Cluster Head Selection Algorithm for Extending Last Node Lifetime in Wireless Sensor Networks
title_sort cluster head selection algorithm for extending last node lifetime in wireless sensor networks
topic wireless sensor network
lifetime of sensor network
cluster head rotation
transmission reduction
internet of things
url https://www.mdpi.com/1424-8220/25/11/3466
work_keys_str_mv AT marcinlewandowski aclusterheadselectionalgorithmforextendinglastnodelifetimeinwirelesssensornetworks
AT bartłomiejpłaczek aclusterheadselectionalgorithmforextendinglastnodelifetimeinwirelesssensornetworks
AT marcinlewandowski clusterheadselectionalgorithmforextendinglastnodelifetimeinwirelesssensornetworks
AT bartłomiejpłaczek clusterheadselectionalgorithmforextendinglastnodelifetimeinwirelesssensornetworks