What type of study is this?

This is a Experimental Study study.

September 16, 2025

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

MAMajid Abdolrazzagh-NezhadUniversity of Birjand MKMahdi KheradUniversity of Qom MDMeimanat DadrasIslamic Azad University of Birjand

Key Points

The dynamic dual head clustering algorithm effectively reduces energy consumption in wireless sensor networks.
Results indicate that the proposed method shows better performance regarding network lifetime compared to other algorithms.
This approach utilizes two cluster heads for efficient data aggregation and communication with the base station.
The proposed clustering method adapts to node mobility and maintains efficiency across varying network densities.

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.

AI에게 질문

Bookmark

View Full Paper