An energy-efficient and dynamic clustering approach for wireless sensor networks

Purpose Wireless sensor networks (WSNs) consist of multiple sensor nodes that are often randomly distributed in the environment and operate independently without human intervention. However, the limited power supply of these nodes presents a significant challenge for WSNs, making the development of energy-saving algorithms critical to increase network lifespan. Node clustering is a commonly used solution to reduce data transfer nodes and achieve data aggregation. Furthermore, the mobility of nodes in the network is often overlooked but can impact energy consumption. Design/methodology/approach This study proposes a Dynamic Dual Head Clustering algorithm for WSNs (DDHCWSN) to reduce energy consumption. Instead of re-clustering in each round, the DDHCWSN updates existing clusters based on energy and position, allowing normal nodes to send data to the closest cluster head (CH) node. The algorithm considers two CHs, one for data aggregation and the other for sending data to the base station (BS), which can have a better effect on network power consumption. Findings To evaluate the proposed method and compare it with state-of-the-art methods in the field of WSN clustering, three different criteria (scalability, network energy consumption and network lifetime) in six different scenarios are considered. According to the obtained results, it can be said that the proposed algorithm shows acceptable behavior in networks with low density, unlike other algorithms. In large networks, DDHCWSN has a longer lifetime than others. Although in small networks, CRDP and DMH-Leach algorithm performed better, but DDHCWSN also performed well. Originality/value The main topics of the proposed algorithm are: (1) Dividing the network into different areas and then generating clusters based on them. (2) Using two separate CHs, one to communicate with members of cluster (data aggregation) and the other to communicate with other CHs and BSs. (3) Updating clusters instead of re-clustering nodes. (4) Select single or multi-hop mode.

Authors

Institutions

Publication Details

Journal
Data Technologies and Applications
Published
2025-09-09
DOI
https://doi.org/10.1108/dta-06-2024-0646
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An energy-efficient and dynamic clustering approach for wireless sensor networks

Mahdi Kherad, Majid Abdolrazzagh-Nezhad, Meimanat Dadras
Data Technologies and Applications
Energy Efficient Wireless Sensor Networks
article

An energy-efficient and dynamic clustering approach for wireless sensor networks

Mahdi Kherad, Majid Abdolrazzagh-Nezhad, Meimanat Dadras
article en

Abstract

Purpose Wireless sensor networks (WSNs) consist of multiple sensor nodes that are often randomly distributed in the environment and operate independently without human intervention. However, the limited power supply of these nodes presents a significant challenge for WSNs, making the development of energy-saving algorithms critical to increase network lifespan. Node clustering is a commonly used solution to reduce data transfer nodes and achieve data aggregation. Furthermore, the mobility of nodes in the network is often overlooked but can impact energy consumption. Design/methodology/approach This study proposes a Dynamic Dual Head Clustering algorithm for WSNs (DDHCWSN) to reduce energy consumption. Instead of re-clustering in each round, the DDHCWSN updates existing clusters based on energy and position, allowing normal nodes to send data to the closest cluster head (CH) node. The algorithm considers two CHs, one for data aggregation and the other for sending data to the base station (BS), which can have a better effect on network power consumption. Findings To evaluate the proposed method and compare it with state-of-the-art methods in the field of WSN clustering, three different criteria (scalability, network energy consumption and network lifetime) in six different scenarios are considered. According to the obtained results, it can be said that the proposed algorithm shows acceptable behavior in networks with low density, unlike other algorithms. In large networks, DDHCWSN has a longer lifetime than others. Although in small networks, CRDP and DMH-Leach algorithm performed better, but DDHCWSN also performed well. Originality/value The main topics of the proposed algorithm are: (1) Dividing the network into different areas and then generating clusters based on them. (2) Using two separate CHs, one to communicate with members of cluster (data aggregation) and the other to communicate with other CHs and BSs. (3) Updating clusters instead of re-clustering nodes. (4) Select single or multi-hop mode.

Data Technologies and ApplicationsVol. 59(4-5)
University of Qom (IR), Islamic Azad University of Birjand (IR), University of Birjand (IR)
Openalex Percentile: Top 72%
Energy Efficient Wireless Sensor Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.