Next Article in Journal
Pressure-Guided LSTM Modeling for Fermentation Quantification Prediction
Previous Article in Journal
Enhancing Real-World Fall Detection Using Commodity Devices: A Systematic Study
Previous Article in Special Issue
Enhanced Fault Detection in Photovoltaic Panels Using CNN-Based Classification with PyQt5 Implementation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

EEL-GA: An Evolutionary Clustering Framework for Energy-Efficient 3D Wireless Sensor Networks in Smart Forestry

Department of Computer Science, Middlesex University, London NW4 4BT, UK
*
Author to whom correspondence should be addressed.
Sensors 2025, 25(17), 5250; https://doi.org/10.3390/s25175250
Submission received: 2 July 2025 / Revised: 8 August 2025 / Accepted: 20 August 2025 / Published: 23 August 2025
(This article belongs to the Special Issue Sensor Enabled Smart Energy Solutions)

Abstract

Wireless Sensor Networks (WSNs) are very important for monitoring complex 3D environments like forests, where energy efficiency and reliable communication are critical. This paper presents EEL-GA, an Energy Efficient LEACH-based clustering protocol optimized using a Genetic Algorithm. Cluster head (CH) selection is guided by a dual-metric fitness function combining residual energy and intra-cluster distance. EEL-GA is evaluated against EEL variants using Particle Swarm Optimization (PSO), Differential Evolution (DE), and the Artificial Bee Colony (ABC) across key performance metrics, including energy efficiency, packet delivery, and cluster lifetime. Simulations using real environmental data confirm EEL-GA’s superiority in sustaining energy, minimizing delay, and improving network stability, making it ideal for smart forestry and mission-critical WSN deployments. The model also incorporates environmental dynamics, such as temperature and humidity, enhancing its robustness in real-world applications. These findings support EEL-GA as a scalable, adaptive solution for future energy-aware 3D WSN frameworks.

1. Introduction

Many applications, such as environmental monitoring, disaster response, and environmental preservation nowadays increasingly rely on Wireless Sensor Networks (WSNs) for efficient data collection and communication [1]. Wireless Sensor Networks (WSNs) are composed of sensor nodes distributed across different locations to collect, process, and send data to Base Stations (BSs). Deploying these networks in complex 3D forest environments can be challenging due to issues with energy efficiency, reliable communication, and adapting to the terrain [2].
Smart forestry uses Wireless Sensor Networks (WSNs) to monitor environmental conditions continuously. These networks include sensor nodes placed in different areas to send information about factors like soil moisture, temperature, and humidity [3,4]. The deployment of these sensors enables real-time data collection, which is vital for understanding forest dynamics and health. By utilizing IoT technology, these networks can connect to the cloud for storage and analysis, providing stakeholders with a comprehensive view of operational conditions [5]. This integration facilitates proactive management strategies, allowing forest managers to respond to environmental changes or potential threats, such as pests or diseases, expeditiously.
In smart forestry, WSNs serve as a backbone for real-time monitoring of environmental parameters, including temperature, humidity, and soil moisture, which play a crucial role in forest management and conservation strategies [6]. Given the remote and often challenging conditions of forest environments, energy efficiency in these networks is paramount. Energy limitations significantly impact network longevity, requiring innovative approaches to clustering and data transmission.
This framework can be implemented using a tiered approach that segments the forestry area into 3D spatial clusters, enabling localized data aggregation and processing to minimize the energy overhead associated with long-range data transmission [7]. Each cluster can dynamically reconfigure itself based on sensor states using adaptive learning-based strategies, effectively distributing communication load and mitigating energy bottlenecks [6]. In practical deployments, this may involve sensor nodes equipped with multi-tier clustering protocols, such as Region-based Hierarchical Clustering for Efficient Routing (RHCER), capable of handling large-scale forestry data while accounting for node-level energy constraints in routing decisions [8]. This evolutionary clustering approach enhances WSN performance in several ways: it extends network lifetime by balancing load during cluster head selection [9,10], improves scalability by adapting to larger deployment areas using evolutionary algorithms [11], and boosts energy efficiency through optimal routing and intra-cluster communication [12,13]. Studies have reported lifespan improvements of approximately 30–46% through metaheuristic clustering protocols involving optimized cluster head selection and routing algorithms [14]. Additionally, this architecture supports real-time environmental monitoring, which is vital for smart forestry management and rapid responses to ecological changes [8,9].
Traditional WSN clustering protocols, such as LEACH, are primarily designed for two-dimensional (2D) environments and often struggle to adapt to 3D topologies, where elevation changes, irregular terrain, and dense foliage significantly impact communication and energy dissipation [15,16]. In forest environments, issues like uneven node placement, long transmission distances, and high path loss frequently lead to rapid energy depletion and network partitioning [17]. To address these challenges, recent advancements have applied evolutionary approach algorithms, including Particle Swarm Optimization (PSO), Genetic Algorithms (GAs), and Differential Evolution (DE) to improve clustering performance and network lifespan [18,19]. While promising, many of these approaches assume static environmental conditions and overlook critical factors, such as residual energy dynamics and intra-cluster communication overhead [20]. This study proposes an enhanced Energy-Efficient LEACH protocol integrated with a Genetic Algorithm (EEL-GA) tailored for 3D WSN deployments. Our model dynamically selects cluster heads (CHs) based on real-time residual energy and 3D intra-cluster distances, guided by a dual-metric fitness function that balances spatial compactness and energy fairness. Unlike conventional clustering models, EEL-GA adapts to topological fluctuations and environmental variations, significantly improving energy conservation and routing efficiency.
In order to contextualize our approach, we consider a use case involving a forested national park prone to seasonal wildfires and illegal logging. In such areas, WSNs can be deployed on tree trunks, the forest canopy, and ground surfaces to monitor environmental conditions and detect unusual activities. Sensors placed at different altitudes report varying levels of signal strength, delay, and energy consumption due to obstruction by dense foliage and terrain elevation. To ensure real-time monitoring and long-term network sustainability in such dynamic conditions, an intelligent, adaptive clustering mechanism becomes essential. This scenario reflects the operational needs that our EEL-GA protocol is designed to address. Moreover, the complex environmental variability and node placement heterogeneity in forest terrains make it necessary to evaluate WSN protocols through simulation before real-world deployment. Our simulation model simulates a realistic forest area using terrain data and empirical measurements. This method allows us to analyze the impact of energy dynamics, cluster configurations, and routing strategies under controlled yet representative conditions.
To evaluate the proposed method, we utilize an environmental dataset collected as part of a research project in the Ziarat Forest region of Balochistan, Pakistan. This dataset includes temporal readings of temperature, humidity, wind speed, and rainfall collected via physical sensor deployments across the forest terrain. These environmental factors were integrated into the simulation model to affect node energy consumption, communication quality, and decision-making under dynamic conditions.
In summary, the deployment of WSNs in complex forest environments faces key challenges: (i) traditional clustering protocols are poorly suited to 3D terrains; (ii) random CH selection contributes to unbalanced energy drain; (iii) environmental influences on communication and power usage are often neglected; and (iv) static routing fails to sustain communication in dynamic topologies. The proposed EEL-GA addresses these issues by introducing an energy-aware, topology-adaptive clustering strategy supported by empirical data and multi-objective optimization.
To address these gaps, this work contributes the following:
i.  
A 3D WSN Simulation: A simulation environment that models sensor deployment in a 3D forest topology using real-world environmental data.
ii. 
EEL-GA Clustering Protocol: A hybrid clustering strategy combining LEACH with a Genetic Algorithm to adaptively select energy-aware CHs.
iii.
Dual-Metric Fitness Function: A novel fitness model that evaluates CH candidates based on residual energy and intra-cluster distance.
iv.
Comparative Evaluation: Benchmarking against EEL-PSO, EEL-DE, and EEL-ABC to validate performance on metrics, including residual energy, cluster lifetime, and latency.
v. 
Deployment Suitability: Demonstrated effectiveness of the protocol in smart forestry use cases requiring long-term, energy-efficient monitoring.

2. Related Work

Energy-efficient clustering remains a pivotal concern in WSNs, particularly under challenging 3D deployment conditions where energy drainage is accelerated due to longer inter-node distances and irregular terrain. Several optimization strategies have emerged to address these challenges by enhancing energy balance, extending network lifetime, and improving spatial coverage [21,22].
To reduce communication overhead and prolong network lifetime, early clustering techniques, such as LEACH (Low-Energy Adaptive Clustering Hierarchy), were introduced [15]. LEACH periodically rotates the role of CHs to evenly distribute energy consumption among nodes. While effective in simple deployments, its probabilistic CH selection often leads to uneven energy depletion and reduced efficiency—particularly in dense or topologically irregular networks [23,24]. The original LEACH protocol suffers from several well-known limitations, including random cluster head (CH) selection, uneven CH distribution, single-hop communication, and limited adaptability to network dynamics [25,26]. According to Ref. [27] propose the MCH-EOR algorithm, which uses a multi-objective fitness function based on residual energy and inter-node distances to optimize cluster-head selection and improve network lifetime and throughput in WSNs, utilizing residual energy and node location data to optimize CH selection. Multi-hop LEACH protocols [28,29] reduce the communication burden for distant CHs by introducing relay nodes. Adaptive extensions, like E-LEACH, dynamically adjust CH roles to balance load and prolong network life [30]. Optimization-based variants incorporate metaheuristic algorithms, such as GAs [31,32], bat algorithms [33], firefly PSO [34], and fuzzy–PSO [35], to improve clustering decisions. PSO-based variants, like [19], dynamically adjust CH roles using spatial and energy-based heuristics. Clustering strategies using K-means, GWO, and Gaussian models have also been studied [36,37]. Additionally, Differential Evolution (DE) [38,39] and Artificial Bee Colony (ABC) [40] algorithms have shown promise in improving CH diversity and minimizing node-level energy usage. These studies highlight the effectiveness of evolutionary methods in improving energy efficiency and network performance.
While most existing studies focus on flat, simulated 2D environments, fewer works address realistic 3D deployments in natural terrains. Notably, ref. [41] presented a comparative study on clustering protocols in synthetic forest environments, showing how terrain and node density affect energy use. Kumar et al. [42] highlighted the overreliance on idealized channel models, reducing real-world applicability. Previous research Ref. [43] introduced a robust 3D clustering framework considering residual energy and spatial uncertainty, but without real sensor validation. Similarly, ref. [44] proposed IMP-RES-EL and EEL protocols, which improved lifetime by 36% and (cluster head) CH-to-BS (Base Station) transmission by 44% but lacked environmental integration. In contrast, the proposed EEL-GA protocol is designed for 3D WSNs in forest environments. It leverages GA-based CH optimization and integrates environmental datasets, offering a scalable and adaptive solution that bridges the gaps in existing LEACH variants.

2.1. Energy Efficiency vs. Energy Harvesting in WSNs

The energy efficiency in a WSN is increasingly prioritized over energy harvesting due to its broader, more consistent benefits and practical applicability. Although energy harvesting (EH) can supplement power in sensor nodes by collecting ambient sources, such as solar, wind, or vibration, it faces several technical and environmental limitations that restrict its reliability and scalability in complex deployments [45,46]. Additional EH sources include thermal gradients, piezoelectric effects, and radio frequency (RF) energy, each with unique constraints related to conversion efficiency, hardware integration, and ambient availability [47,48,49]. These limitations become more pronounced in obstructed, indoor, or remote natural environments where ambient energy is intermittent or insufficient.
Energy efficiency strategies, such as clustering-based routing, adaptive duty cycling, and load balancing, offer predictable and scalable solutions that directly reduce energy consumption without depending on variable ambient energy. Different studies show that energy-efficient methods reduce overall carbon emissions by lowering power requirements from non-renewable sources, contributing significantly to sustainability goals [50,51]. Furthermore, energy-efficient systems require lower infrastructure overhead than EH-enabled architectures, which often need Maximum Power Point Tracking (MPPT) and energy storage mechanisms [52]. From an economic standpoint, energy-efficient networks also prove more cost-effective. Efficient technologies reduce both installation and operational costs, offer quicker returns on investment, and require fewer maintenance interventions compared to EH systems that rely on external hardware and unpredictable environmental conditions [53]. Additionally, energy efficiency supports the creation of green jobs and promotes long-term economic sustainability by enabling energy-literate behaviors and policies [54].
Socially, energy-efficient systems improve indoor and ambient air quality, particularly in environments where inefficient energy use contributes to pollution. This leads to reduced health risks and better public well-being [55]. In contrast, EH techniques provide limited support for such social impacts, especially in low-light or obstructed settings where ambient energy capture is insufficient [48]. While energy harvesting remains a valuable complementary approach, especially in isolated or renewable-rich environments, the inherent uncertainties in energy supply and the hardware complexity involved make it less viable as a standalone solution for sustainable WSN operation. Therefore, this work focuses on optimizing energy efficiency through clustering and load balancing, which provides a more stable and scalable alternative to maintain WSN performance in real-world conditions. Table 1 highlights a direct comparison between energy efficiency and energy harvesting in WSNs, reinforcing the rationale behind the proposed energy-efficient model in this study.
In contrast to prior work, the current study proposes an EEL-GA protocol tailored specifically for 3D WSNs in forest environments, incorporating real-time datasets and optimizing for both energy and spatial metrics. Unlike existing LEACH-based hybrids that operate on ideal assumptions, our model dynamically responds to topological variation and environmental impact factors, thereby filling a critical research gap.
Table 2 summarizes key deployment-focused optimization methods used in WSN research.

2.2. Comparative Summary of Optimization Techniques

Table 3 highlights recent optimization-based CH selection protocols, including Firefly, Game Theory, and GA-based techniques. The proposed EEL-GA algorithm exhibits superior results in residual energy, transmission delay, and cluster longevity in 3D settings.
Recent studies have increasingly focused on nature-inspired optimization algorithms, such as Particle Swarm Optimization (PSO), the Genetic Algorithm (GA), Differential Evolution (DE), and the Artificial Bee Colony (ABC), due to their proven performance and popularity across a range of WSN applications. These algorithms have demonstrated high effectiveness in energy-efficient clustering and network lifetime improvement in wireless sensor networks [63]. For instance, DE and PSO are particularly noted for their superior performance in solving numerical optimization problems [64]. Each algorithm offers adaptability to complex optimization challenges: PSO mimics social behavior and dynamically explores the search space to optimize energy consumption strategies [65], while the GA is suitable for combinatorial tasks, such as cluster head selection. In terms of search mechanisms, GA uses crossover and mutation operations, DE employs differential mutations for faster convergence [66], and the ABC leverages foraging behavior for efficient local search and global exploration. These features also make them applicable in 3D forest deployments, where terrain and spatial irregularities affect sensor placement and performance [67]. Despite the availability of other metaheuristic techniques, a direct and comparative analysis of these four popular algorithms remains underexplored, which justifies their selection in the current study [63].
Table 3. Comparative summary of recent WSN optimization techniques.
Table 3. Comparative summary of recent WSN optimization techniques.
AlgorithmYearKey FeaturesAdvantages
FCFAD [68]2024Fractal Clustering + Firefly OptimizationEnhances area coverage and connectivity
MFG-LEACH [69]2024Game-theoretic CH SelectionReduces energy use; boosts packet delivery
IMP-RES-EL [70]2024Residual Energy-based CH SelectionProlongs network life by up to 52%
ECH [39]2024Adaptive Duty CyclingReduces data redundancy; saves energy
AVOACS [71]2024African Vulture OptimizationEnsures stable, energy-balanced CH roles
3D-DEEC [72]2024Clustering for 3D UWSNsEnergy fairness in volumetric networks
SCHSM [73]2024Stochastic CH SelectionMaintains energy balance for IoT
EEL-GA (Proposed)2025GA-based CH Selection for 3D WSNsBetter energy retention, lifetime, and delay minimization

2.3. Deployment Challenges in 3D Forest Environments

WSNs deployed in forest terrains face unique challenges, notably due to obstacles like foliage, terrain elevation, and node inaccessibility. As discussed in [74], heterogeneous topologies, including relay and sink nodes, offer more resilient communication pathways. However, while 2D deployments have been well studied [75], 3D topologies require more sophisticated spatial modeling and clustering.
Random sensor placement is suitable for large, inaccessible areas but often leads to energy inefficiency. Predetermined deployment ensures controlled coverage but lacks scalability. Thus, optimization-based deployments tailored for 3D terrains are essential.

2.4. Recent Advances in Sensor Deployment for 3D Environments

Recent studies employ bio-inspired algorithms for 3D WSN optimization. Works such as [76,77] explore coverage-efficient deployment via evolutionary models. Others, like [78,79], propose polynomial-time heuristics for constrained 3D sensor grids.
PSO remains a favored approach for sensor positioning and adaptive clustering in 3D environments. Studies [80,81] highlight its adaptability in mobile and underwater WSNs. Similarly, ABC algorithms have also been explored for dynamic CH selection and energy-efficient node management.
The literature consistently supports the need for hybrid optimization strategies to address the multi-constraint nature of 3D deployments. Our proposed EEL-GA aligns with these trends and extends them through real-world environmental data integration and a fitness-based, multi-metric clustering approach.

3. Structure of Wireless Sensor Node

In a WSN, the architecture of a sensor node is central to enabling efficient data acquisition, processing, and transmission. As shown in Figure 1, each sensor node is powered by an energy source that supplies power to its internal components. The energy is distributed to key subsystems, including the Sensing Unit, Central Processor (Information Processing Unit), Power Unit, and the Communication Module (Transceiver). These integrated components enable the node to perform sensing, processing, and wireless communication, supporting real-time environmental monitoring and efficient participation in cluster-based communication protocols.
Sensor nodes capture data from the surrounding environment, perform in-node processing to reduce redundancy, and transmit the information to the BS (Base Station), either directly or via multi-hop clustering protocols, such as LEACH. The Base Station (BS) interfaces with the user through the Internet, allowing remote access to sensor data. This integrated architecture ensures energy efficiency, adaptability, and scalability for deployment in complex environments.

3.1. Node Roles in Hierarchical WSNs

A hierarchical WSN architecture typically comprises four distinct node roles. Regular sensor nodes are responsible for sensing environmental parameters and transmitting the data to a designated CH; they are energy-constrained and constitute the bulk of the network [82]. CHs handle the aggregation and compression of data received from their member nodes and forward it to the Base Station; due to their critical role, CHs experience higher energy consumption [83]. In multi-hop communication scenarios, some CHs may function as CH-to-sink forwarders, relaying data from more remote CHs toward the BS. Finally, the BS serves as the central data sink, typically positioned either inside or outside the monitored area, and is equipped with unlimited energy and computational resources [84].

3.2. Communication Types in WSNs

The communication architecture in hierarchical WSNs typically involves three primary patterns. Intra-cluster communication refers to the process where member nodes transmit their sensed data to the respective CHs using short-range links, thereby conserving energy. Inter-cluster communication occurs when CHs relay data to adjacent CHs, which is particularly beneficial in large-scale or obstructed terrains that necessitate multi-hop transmissions. Finally, CH-to-sink communication involves the transmission of aggregated data from CHs to the BS, which may be performed through either single-hop or multi-hop strategies depending on the network’s routing protocol [85].

3.3. 3D Sensor Deployment Strategy

The deployment strategy incorporates both random and fitness-based spatial techniques. Initially, sensor nodes are randomly distributed within a 1 km 3 three-dimensional cubic space, simulating unpredictable aerial deployment scenarios [86]. Following this, a fitness-based spatial evaluation is applied where node positions are assessed based on metrics such as residual energy and intra-cluster distances [87]. This approach ensures that nodes with higher energy levels are positioned at optimal locations to serve as CHs, thereby enhancing overall network efficiency and lifetime.

3.4. Energy-Aware Operation Framework

Efficient energy management extends the operational lifetime of the WSN. The proposed system integrates several strategies. The LEACH (Low-Energy Adaptive Clustering Hierarchy) protocol facilitates dynamic role rotation among sensor nodes, effectively balancing energy consumption throughout the network [15]. CHs employ data aggregation techniques, such as fusion algorithms, to eliminate redundant transmissions and optimize bandwidth usage [88]. Additionally, sleep scheduling mechanisms allow idle nodes to switch to low-power modes based on their activity cycles, significantly reducing unnecessary energy consumption [89]. In more advanced WSNs, mobility support can be integrated through mobilizers that reposition nodes in response to environmental variations or node failures, enhancing network adaptability.
This structured, layered design, coupled with dynamic clustering and energy-centric deployment, renders the WSN resilient, sustainable, and suitable for smart forestry and other real-time monitoring applications in challenging 3D environments.

4. Design Model

For clarity of visualization, Figure 2 first illustrates a 2D projection of sensor node deployment, showing overlapping coverage zones, clustering, and non-covered regions. This simplified view helps highlight the limitations of earlier 2D models used in previous studies. Building on this, the present work considers the challenge of deploying wireless sensor nodes in a realistic 3D forest environment, as illustrated in Figure 3. A total of N sensor nodes (e.g., environmental or image sensors) are deployed to ensure volumetric coverage. These nodes are responsible for sensing environmental parameters and forwarding the collected data to the BS through relay nodes. Relay nodes serve as intermediate communication hubs, helping balance the energy burden across the network and extending the operational lifetime of the WSN.

Deployment Position of Sensors

Sensor nodes are strategically placed on trees or elevated forest structures to optimize visibility and connectivity in a three-dimensional space. For planning and visualization, the 3D coordinates of deployed nodes are mapped onto a 2D plane.
This 2D projection serves as a conceptual aid to illustrate sensing coverage and overlap in a simplified view, offering an abstract representation of spatial deployment prior to introducing the full 3D environment. As shown in (Figure 2), sensor nodes (blue circles) are distributed across the area, each with a sensing range represented by a red, green, or black circle. Overlapping zones indicate regions where multiple nodes provide coverage, while non-covered areas represent sensing gaps caused by irregular deployment.
b x = l 1 , b y = w 1 , b z = h 1
Here, l , w , h denote the length, width, and height of the forested area, respectively. We consider a 3D deployment space defined by the bounds ( x , y , z ) [ 0 , l 1 ] × [ 0 , w 1 ] × [ 0 , h 1 ] . Sensor nodes are probabilistically deployed by sampling 3D coordinates using a fitness-guided probability function. This approach does not rely on a fixed 2D-to-3D mapping, but instead uses energy and spatial criteria to bias node placement for efficient clustering.
P ( x , y , z ) = σ energy ( x , y , z ) + D intra ( x , y , z ) k = 1 N σ energy ( x k , y k , z k ) + D intra ( x k , y k , z k )
Here, σ energy represents the normalized residual energy of a node, D intra denotes the intra-cluster distance to candidate CHs, and N is the total number of nodes in the network. This probabilistic distribution promotes the selection of nodes with higher residual energy and better cluster centrality, supporting efficient cluster formation and enhanced communication longevity.
Figure 2 illustrates a 2D top-view projection (xy plane) of the randomly deployed sensor nodes, primarily for visualization clarity. This is followed by the full 3D layout shown in Figure 3, where each node is extended along the z-axis to reflect elevation differences in the forest environment. The 2D projection helps identify node clustering and spatial distribution from above, while the 3D layout provides a complete view of deployment in a realistic terrain.

5. Sensing Model Approach

To accurately model coverage in a 3D setting, the sensing model considers both the Euclidean distance and directional angles. The probability of a sensor r detecting a point q is defined as
P ( r , q ) = P α ( r , q ) · P β ( r , q ) · P γ ( r , q ) .
Here, P α ( r , q ) represents the sensing probability based on radial distance, P β ( r , q ) accounts for the horizontal angular position, and P γ ( r , q ) captures vertical angular alignment. These three components together determine the overall sensing probability in a 3D spatial environment.
This separable angular model (adapted from [90]) enables more realistic 3D volume coverage, especially in dense forest environments. Unlike traditional elliptical sensing approximations, this model assumes a rectangular field-of-view, offering a more accurate representation of sensor coverage in complex terrains.

5.1. Network Assumption

The WSN operates within a 1 km3 forested region, where N homogeneous and stationary nodes are randomly distributed. Each node is aware of its location and initial energy. The BS is located at a fixed coordinate, typically at the corner or center of the region.
Node positions are sampled using
x i U ( 0 , L ) , y i U ( 0 , W ) , z i U ( 0 , H ) .
Clustering is performed periodically using the proposed EEL-GA approach, based on two principal criteria:
  • Residual energy of nodes;
  • Intra-cluster distance to the CH.
According to [91] the fitness function for cluster head selection is
F i = w 1 · E i ( r ) E ¯ ( r ) + w 2 · 1 d i d m a x .
In this context, E i ( r ) represents the residual energy of node i at round r, while E ¯ ( r ) denotes the average energy of the entire network during the same round. The term d i refers to the average distance between node i and its associated cluster members, and d m a x defines the maximum allowable intra-cluster distance threshold for maintaining efficient communication. Nodes with the highest fitness scores are selected as CHs, with reclustering triggered when energy levels or distances exceed predefined limits.

5.2. Energy Consumption Model for Data Transmission and Reception

This study adopts the first-order radio model [15] to evaluate energy usage for both transmission and reception.
E T x ( k , d ) = E e l e c · k + E a m p · k · d 2 , E R x ( k ) = E e l e c · k
Here, k represents the packet size in bits, and d denotes the communication distance. The parameter E e l e c refers to the energy consumed by the electronic circuitry for processing each bit, while E a m p signifies the energy required for signal amplification over the transmission distance.
The radio energy dissipation model, which shows the energy cost for transmission and reception in WSN nodes, is illustrated in Figure 4. This energy model is integrated into the clustering decision-making, influencing CH selection by penalizing nodes with low energy or long-range communication burdens. In this model, sensor nodes are assumed to be randomly deployed across the 3D forested region using a uniform distribution. Although placement is stochastic, each node remains stationary after deployment, reflecting realistic forest monitoring setups where sensors are typically mounted on trees or fixed platforms. Furthermore, each node is assumed to be aware of its position (e.g., via GPS or anchor-based localization) to facilitate accurate distance calculations during clustering. This combination of random deployment and position awareness ensures realistic spatial modeling while supporting energy-aware routing and cluster formation mechanisms in the proposed EEL-GA framework.

5.3. Sensing Distance Modeling

The sensing probability due to distance is modeled as [92]
P α ( r , q ) = 1 , δ [ 0 , R δ ] exp δ R δ R max R δ μ / δ × 1 + tan δ R δ R max R δ ν / δ , δ ( R δ , R max ] 0 , δ > R max .
Here [77], δ is the Euclidean distance between the sensor and target:
δ = ( x r x q ) 2 + ( y r y q ) 2 + ( z r z q ) 2 .
This model reflects the gradual decline in sensing efficiency with increasing distance and aligns well with forested propagation environments.

5.4. Cluster Head Selection Using LEACH

According to [15] LEACH selects CHs probabilistically using the threshold by
T ( n ) = p 1 p · ( r mod 1 p ) , n G 0 , otherwise ,
where
  • p: desired CH probability;
  • r: current round;
  • G: nodes not selected as CHs in the last 1 / p rounds.
This ensures fair role rotation among nodes. In our EEL-GA hybrid model, this baseline LEACH strategy is enhanced using a GA-based fitness function to select more optimal and energy-efficient CHs across the 3D space.

6. Energy-Efficient LEACH Genetic Algorithm (EEL-GA)

This section presents the proposed hybrid clustering approach, EEL-GA, which combines the LEACH protocol with GA optimization to enhance energy efficiency in 3D WSNs. The goal is to intelligently select CHs that are energy-rich, spatially central, and load-balanced, thereby extending the network lifetime.

6.1. Unified Dual-Metric Fitness Function for CH Selection

In the proposed Genetic Algorithm, each chromosome represents a set of candidate CHs. A multi-objective fitness function evaluates the quality of each solution by considering three key factors: residual energy, distance to the BS, and cluster load [93]:
Fitness i = w 1 · E i E max w 2 · D i , BS D max w 3 · 1 N i .
Here, E i is the residual energy of CH i, D i , BS is the distance from CH i to the BS, and N i is the number of member nodes in the cluster. The weights w 1 , w 2 , w 3 are positive and satisfy w 1 + w 2 + w 3 = 1 , determining the influence of each metric. This initial fitness evaluation Equation (5) is used to preselect candidate CHs before evolving them using the GA-based fitness function in Equation (6).
The first term promotes energy-efficient CHs, the second minimizes communication cost, and the third helps balance cluster loads. This combination ensures the selection of CHs that extend network lifetime, reduce energy consumption, and prevent node overloading [94].
To select suitable values for the weights, multiple combinations were tested through simulation. Each set of weights was evaluated based on its impact on energy efficiency, network lifetime, and load balancing. The final combination was chosen because it showed the best overall performance across these three aspects. While more advanced methods, such as Pareto optimization, could be applied in future work, this study focused on practical testing to determine effective values.

6.2. Flowchart of EEL-GA Execution

To illustrate the logical flow of the EEL-GA algorithm in 3D WSN, Figure 5 shows the hybrid procedure designed to optimize energy-efficient communication. The process starts with node deployment and cluster formation using LEACH. The GA refines cluster head (CH) selection by evaluating energy and distance-based fitness metrics. This fitness evaluation is performed using the dual-metric function described in Equation (6), while Equation (5) was initially explored for multi-objective evaluation, which balances residual energy fairness and spatial compactness for optimal CH selection. If CHs are not optimal, the process iterates using genetic operations (selection, crossover, mutation). Once CHs are selected, data transmission takes place from nodes to CHs and from CHs to the BS. The system periodically checks network vitality and triggers reclustering if any CH has energy below average or exceeds distance thresholds. The loop continues until the network is no longer operational.

6.3. Algorithm Description

The EEL-GA operational framework is summarized in Algorithm 1. It iteratively updates the network topology through reclustering and energy monitoring. Each round evaluates and evolves CH configurations based on fitness scores derived from node characteristics and environmental conditions.
Algorithm 1 EEL-GA: Energy-Efficient LEACH Clustering using the Genetic Algorithm.
Input: Number of nodes N, initial energy E 0 , population size P, number of generations G, cluster probability p, number of clustering rounds R, 3D area parameters, environmental dataset
Output: Optimized cluster head list C H , energy metrics, performance statistics
  1:
Deploy N sensor nodes randomly within a 1000 m × 1000 m × 1000 m region
  2:
Initialize energy and load environment parameters (e.g., temperature, humidity)
  3:
Perform initial CH evaluation using Equation (5) based on residual energy, distance to BS, and cluster load
  4:
Generate initial GA population representing CH configurations of size P
  5:
Set generation count g = 1
  6:
for each round r R  do
  7:
    Evaluate node failures based on energy threshold
  8:
    Calculate σ energy and D intra for fitness evaluation
  9:
    Adjust environmental impact using dataset parameters
10:
    while  g G  do
11:
        Evaluate population using
f = α · σ energy + ( 1 α ) · D intra
12:
        Select parents based on fitness
13:
        Apply crossover and mutation to generate offspring
14:
        Replace worst individuals with offspring
15:
         g = g + 1
16:
    end while
17:
    Select best individual (CH configuration)
18:
    Form clusters by assigning nodes to nearest CH
19:
    Calculate energy consumption using
E T x ( k , d ) = E e l e c · k + E a m p · k · d 2
20:
    Update node energy, collect QoS metrics
21:
end for
22:
return Final CH set, clustering results, and performance indicators

6.4. Evolution Strategy and Dual-Metric Fitness Function

To ensure spatial compactness and balanced energy distribution among CHs, a dual-metric fitness function is employed:
F = α · σ energy + ( 1 α ) · D intra .
In this fitness function, the weighting coefficient α plays a crucial role in balancing energy fairness ( σ energy ) and spatial compactness ( D intra ) during cluster head (CH) selection. To determine an appropriate value for α , we conducted iterative empirical testing over a range from 0.1 to 0.9 (in increments of 0.1). Each setting was evaluated based on its impact on residual energy, cluster lifetime, and packet delivery ratio. Among these, α = 0.6 provided the best overall trade-off between energy conservation and spatial efficiency in the 3D forest deployment and was therefore adopted for the final implementation.
The parameters used in the fitness evaluation include the following: σ energy , which represents the standard deviation of residual energies among the CHs, reflecting energy fairness; D intra , denoting the average intra-cluster distance that influences spatial compactness; and α , a weighting factor that balances the trade-off between energy distribution and spatial efficiency.
Each generation applies
C new = Crossover ( C 1 , C 2 ) , C mutated = Mutation ( C new ) .
Diversity in the population is maintained via mutation, while elite chromosomes guide convergence [95].

6.5. Clustering and Spatial Communication

The proposed EEL-GA framework organizes the wireless sensor network into multiple clusters. Each cluster comprises several sensor nodes (depicted as red circles) and one designated cluster head (CH), represented by a blue diamond. As shown in Figure 6, sensor nodes transmit their collected data to their respective CHs through intra-cluster communication (black dashed lines). After data aggregation, CHs forward the information either directly to the BS using CH-to-sink communication (green dashed lines) or via neighboring CHs through inter-cluster communication paths (yellow dashed lines), depending on routing conditions and energy considerations. These communication paths are optimized by the proposed EEL-GA algorithm. While the framework builds upon the traditional LEACH architecture, it replaces random CH selection and static single-hop transmission with a fitness-based Genetic Algorithm that considers residual energy, spatial positioning, and dynamic environmental variables [96]. This approach enables energy-efficient, adaptive routing across complex 3D forest deployments.
This structure not only improves energy efficiency but also provides robustness against node failures. If a sensor node or CH fails, neighboring clusters can reconfigure or redirect traffic adaptively, maintaining communication continuity in the network.

6.6. Fitness-Based CH Selection with Spatial Metrics

In complex terrains, CHs are selected based on a composite metric that combines residual energy, node density, distance to the BS, and link quality—ensuring robust, energy-efficient deployment under environmental heterogeneity [97]:
f = Φ 1 z 1 + Φ 2 z 2 + Φ 3 z 3 , Φ 3 = 1 Φ 1 Φ 2 .
The composite fitness metric incorporates three essential clustering objectives. The first component, z 1 , represents the average 3D distance to the cluster head, promoting spatial compactness and reducing intra-cluster communication cost. The second component, z 2 , captures energy balance within the cluster, computed as E avg C n E p , and encourages the selection of nodes with higher residual energy, thereby extending the network’s lifetime. The third component, z 3 , defined as the inverse of the cluster size 1 C n , helps regulate the cluster load by penalizing disproportionately large clusters. Together, these components ensure energy-aware, balanced, and spatially efficient clustering.

6.7. Genetic Population Evolution Strategy

The EEL-GA protocol applies classical Genetic Algorithm operations to evolve a population of candidate CH configurations across generations. Each chromosome encodes a potential set of CHs. During each generation, the following takes place:
  • Selection: The fittest chromosomes (based on residual energy and intra-cluster distance) are selected using tournament or roulette-based methods.
  • Crossover: Selected parents exchange segments to create offspring, encouraging exploration of new CH combinations.
  • Mutation: With a small probability, gene values are randomly altered to maintain diversity and prevent premature convergence.
  • Replacement: Weaker chromosomes are replaced by fitter offspring, ensuring that the population progressively evolves toward optimal clustering configurations.
This evolutionary process continues over fixed generations and yields a final CH set with balanced energy usage and optimized spatial layout.

6.8. Simulation Setup

The simulation environment was implemented in MATLAB R2024b and configured based on the parameters listed in Table 4. The 3D deployment was randomized across a simulated forest terrain of 1000 m × 1000 m × 1000 m to reflect vertical and horizontal irregularities commonly found in real forest ecosystems. Node energy levels were initialized using a normal distribution around 0.5 J to model non-uniform deployment states. To ground our model in real-world constraints, the environmental conditions were derived from an actual deployment in the Juniper Forest of Ziarat, Balochistan. The recorded parameters, including temperature, humidity, soil moisture, wind speed, and light, were used to adjust signal propagation factors, energy consumption behavior, and packet loss simulations. For example, higher humidity levels degraded the radio signal strength, influencing the path loss exponent dynamically within the simulation. This tuning allowed us to evaluate the robustness and adaptability of the EEL-GA protocol under forest-like environmental stressors.
As shown in Table 4, a small population size of 10 is selected to reduce computational complexity and energy usage during cluster setup. This choice is suitable for WSN scenarios, where faster convergence and lower overhead are critical. Previous studies [98,99] have also demonstrated that small population sizes can be effective in achieving optimization results achieving best-known fitness within 10 generations, as validated in prior WSN studies using small population sizes, i.e., 4–14 as shown in [100]. The main simulation parameters and their selection rationale are summarized in Table 5.

6.9. Environmental Impact on WSN Operations and EEL-GA Adaptations

Environmental conditions significantly influence the performance and reliability of WSNs. Key factors such as temperature, humidity, and precipitation can degrade communication quality and reduce node longevity. The EEL-GA algorithm incorporates adaptive strategies to mitigate these effects, as summarized in Table 6.
Studies have shown that higher temperatures can reduce wireless communication quality, requiring increased transmission power to maintain stable connections [101]. Similarly, high humidity levels can cause signal attenuation, leading to increased packet loss and retransmissions. Precipitation, such as rainfall, can physically damage sensor nodes and further degrade signal propagation [102]. To address these challenges, EEL-GA dynamically adjusts node operations, including duty cycling, transmission power, and routing decisions, based on real-time environmental data, thereby enhancing network resilience and longevity.

7. Results and Discussion

This section provides a comprehensive performance evaluation of the proposed Energy-Efficient LEACH with the Genetic Algorithm (EEL-GA) protocol in comparison with three other LEACH-based hybrid optimization methods: EEL-PSO (Particle Swarm Optimization), EEL-DE (Differential Evolution), and EEL-ABC (Artificial Bee Colony). The analysis is based on key metrics including residual energy, cluster lifetime, scheduling overhead, average transmission delay, and the packet delivery rate. Simulations were conducted using MATLAB with realistic node deployment scenarios derived from the real-time dataset.

7.1. Scheduling Overhead vs. Node Density

Scheduling overhead refers to the number of control packets exchanged during cluster formation and maintenance, such as cluster head (CH) selection notifications, cluster join requests, and periodic status updates. In this study, the overhead is measured by counting the cumulative number of these control messages generated in each round, excluding standard data transmissions. As shown in Figure 7, the EEL-GA protocol exhibits the lowest scheduling overhead across all tested node densities, outperforming EEL-PSO, EEL-DE, and EEL-ABC. This efficiency results from EEL-GA’s optimized clustering process, which reduces redundant control signaling by selecting stable and energy-efficient CHs. Minimizing scheduling overhead is critical in WSNs, particularly in forest environments, where excessive control communication can lead to unnecessary energy expenditure and increased contention on wireless channels.

7.2. Residual Energy vs. Node Density

Residual energy is a direct measure of how efficiently a WSN conserves power during operation. In this study, residual energy is calculated by summing the remaining energy across all sensor nodes at the end of each simulation round. Higher residual energy values indicate lower overall energy consumption and better sustainability of the protocol. As depicted in Figure 8, the proposed EEL-GA approach consistently preserves more residual energy than the comparative clustering protocols: EEL-PSO, EEL-DE, and EEL-ABC. This performance can be attributed to the dual-objective fitness function employed in EEL-GA, which favors the selection of cluster heads (CHs) with higher remaining energy and closer proximity to their members. This energy-aware clustering strategy prevents overburdening weaker nodes, resulting in a more balanced energy expenditure throughout the network. The results clearly demonstrate EEL-GA’s effectiveness in extending the network lifetime, particularly under increased node density scenarios where energy efficiency becomes more critical. To further validate the significance of the observed differences, a one-way ANOVA followed by Tukey’s post hoc test was conducted on the residual energy values across all optimization methods. The results confirmed that the differences were statistically significant (p < 0.05), reinforcing the superiority of EEL-GA in maintaining higher residual energy under varying network densities.

7.3. Cluster Lifetime vs. Number of Clusters

Cluster lifetime reflects the operational duration of a cluster before it becomes inactive due to energy depletion or node disconnection, whereas cluster lifetime is measured by tracking the number of simulation rounds during which a given cluster remains active. A cluster is considered active as long as its designated CH remains functional and maintains at least one member node. Once the CH fails or all members leave or die, the cluster is marked inactive, and the lifetime is recorded. As shown in Figure 9, the EEL-GA algorithm consistently maintains longer-lasting clusters compared to EEL-PSO, EEL-DE, and EEL-ABC. The x-axis represents the number of clusters formed in the network, while the y-axis indicates the average operational lifetime of these clusters measured across simulation rounds. This improvement is primarily due to EEL-GA’s CH selection mechanism, which takes into account both the residual energy and spatial proximity of nodes. By preventing the assignment of high-load roles to low-energy nodes and maintaining compact cluster formations, the protocol minimizes early CH failures. As a result, the network remains structurally stable for a longer period, supporting prolonged monitoring operations in energy-constrained forest environments.

7.4. Average Transmission Delay vs. Node Density

Average transmission delay quantifies the time required for data packets to reach the BS from sensor nodes. The average transmission delay is measured by recording the time each data packet is generated at the source node and the time it is successfully received at the BS. The delay for each packet is computed as the difference between these two timestamps, and the average is taken across all successfully delivered packets during the simulation. This measurement simply captures the time difference between when a data packet is generated at the source node and when it is successfully received at the BS, averaged across all delivered packets. Lower delay indicates more efficient routing and reduced communication latency. As depicted in Figure 10, EEL-GA consistently outperforms other algorithms by achieving minimal delays, particularly in scenarios with high node density. This improvement stems from EEL-GA’s ability to establish compact clusters and select CHs that are optimally positioned. Consequently, the protocol minimizes intra-cluster communication distances, enabling faster data transfer and supporting latency-sensitive WSN applications.

7.5. Packet Delivery Ratio vs. Node Density

Figure 11 illustrates the relationship between the node density and packet delivery ratio (PDR) across four clustering protocols: EEL-GA, EEL-PSO, EEL-DE, and EEL-ABC. In this work, the packet delivery ratio (PDR) is defined as the amount of data (in kilobits) successfully delivered to the BS per second, measured in kilobits per second (kbps). It is calculated by measuring the total volume of correctly received packets at the BS over time and dividing it by the total simulation duration, providing a reliable indicator of throughput. The x-axis represents the number of active sensor nodes in the network, while the y-axis measures the PDR in kilobits per second (kbps). As node density increases, all algorithms exhibit a general improvement in PDR, indicating enhanced data throughput due to better network connectivity. However, EEL-GA consistently outperforms the other methods across all densities. This performance advantage stems from its intelligent CH selection strategy based on the residual energy and intra-cluster distance, which improves data aggregation and reduces packet loss. Compared to EEL-PSO, EEL-DE, and EEL-ABC, the EEL-GA protocol demonstrates more efficient routing and fewer dropped packets, particularly in high-density deployments. These results confirm its effectiveness for large-scale forest monitoring scenarios where high data reliability is essential.

8. Conclusions

This paper presented an enhanced clustering framework, EEL-GA, for energy-efficient communication in three-dimensional Wireless Sensor Networks (WSNs) deployed in forest environments. The proposed protocol integrates the classic LEACH model with a Genetic Algorithm to enable adaptive and energy-aware cluster head (CH) selection based on residual energy and intra-cluster distance metrics. Through simulation experiments grounded in real-world data collected from the Juniper Forest of Ziarat, Balochistan, the EEL-GA protocol demonstrated significant improvements in key performance indicators, including scheduling overhead, residual energy conservation, cluster lifetime, transmission delay, and packet delivery rate. Unlike traditional clustering models designed for flat or 2D surfaces, the EEL-GA approach accounts for the topological complexity of forest environments by simulating deployment over a 3D terrain. This not only improves the spatial accuracy of routing decisions but also ensures energy load balancing by preventing overuse of high-elevation or isolated nodes. By incorporating environmental influences, such as temperature and humidity, into the simulation parameters, the model closely mimics field conditions, improving its practical relevance and reliability. Adaptive mechanisms embedded within EEL-GA ensure robustness against signal degradation and dynamic node conditions—critical for applications like smart forestry where reliability and longevity are essential. The comparative analysis further validated EEL-GA’s superiority over similar hybrid optimization techniques, such as EEL-PSO, EEL-DE, and EEL-ABC. In each tested scenario, EEL-GA consistently outperformed in terms of energy efficiency, latency minimization, and network longevity—supporting its suitability for real-world forestry deployments. In future work, the EEL-GA protocol may be extended by integrating lightweight encryption modules to address the security dimension without increasing computational burden. Additionally, the dynamic adjustment of cluster parameters in response to seasonal changes or critical events (e.g., wildfire risk or illegal logging alerts) can be incorporated to improve autonomous response. Field validation in additional forested regions could further support the scalability and adaptability of the model in diverse ecological settings.

Author Contributions

Conceptualization, F.B.; Methodology, F.B.; Software, F.B.; Formal analysis, F.B.; Investigation, F.B.; Writing—original draft, F.B.; Writing—review & editing, K.A., A.L. and D.W.; Supervision, K.A., A.L., D.W. and A.K. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data presented in this study are not publicly available due to institutional or third-party restrictions.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Akyildiz, I.F.; Su, W.; Sankarasubramaniam, Y.; Cayirci, E. Wireless sensor networks: A survey. Comput. Netw. 2002, 38, 393–422. [Google Scholar] [CrossRef]
  2. Mnasri, S.; Nasri, N.; van den Bossche, A.; Val, T. Improved many-objective optimization algorithms for the 3D indoor deployment problem. Arab. J. Sci. Eng. 2019, 44, 3883–3904. [Google Scholar] [CrossRef]
  3. Codeluppi, G.; Cilfone, A.; Davoli, L.; Ferrari, G. LoRaFarM: A LoRaWAN-based smart farming modular IoT architecture. Sensors 2020, 20, 2028. [Google Scholar] [CrossRef] [PubMed]
  4. Al-Qurabat, A.K.M.; Kadhum Idrees, A. Data gathering and aggregation with selective transmission technique to optimize the lifetime of Internet of Things networks. Int. J. Commun. Syst. 2020, 33, e4408. [Google Scholar] [CrossRef]
  5. Yousefpour, A.; Fung, C.; Nguyen, T.; Kadiyala, K.; Jalali, F.; Niakanlahiji, A.; Kong, J.; Jue, J.P. All one needs to know about fog computing and related edge computing paradigms: A complete survey. J. Syst. Archit. 2019, 98, 289–330. [Google Scholar] [CrossRef]
  6. Al-Tous, H.; Barhumi, I. Reinforcement learning framework for delay sensitive energy harvesting wireless sensor networks. IEEE Sens. J. 2020, 21, 7103–7113. [Google Scholar] [CrossRef]
  7. Hao, J.; Chen, Q.; Huo, H.; Zhao, J. Energy efficient clustering algorithm for data gathering in wireless sensor networks. J. Netw. 2011, 6, 490. [Google Scholar] [CrossRef]
  8. Gupta, D.; Wadhwa, S.; Rani, S.; Khan, Z.; Boulila, W. EEDC: An energy efficient data communication scheme based on new routing approach in wireless sensor networks for future IoT applications. Sensors 2023, 23, 8839. [Google Scholar] [CrossRef] [PubMed]
  9. Regilan, S.; Hema, L. Optimizing energy efficiency and routing in wireless sensor networks through genetic algorithm-based cluster head selection in a grid-based topology. J. High Speed Netw. 2024, 30, 569–582. [Google Scholar] [CrossRef]
  10. Kumar, N.; Kaur, J. Improved leach protocol for wireless sensor networks. In Proceedings of the 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing, Wuhan, China, 23–25 September 2011; pp. 1–5. [Google Scholar]
  11. Naveen, J.; Alphonse, P.; Chinnasamy, S. 3D grid clustering scheme for wireless sensor networks. J. Supercomput. 2020, 76, 4199–4211. [Google Scholar] [CrossRef]
  12. Soni, S.S.; Chand, N. Energy Efficient Multi-Level Clustering To Prolong The Lifetime of Wireless Sensor Networks. arXiv 2010, arXiv:1005.4031. [Google Scholar] [CrossRef]
  13. Javaid, N.; Qureshi, T.N.; Khan, A.H.; Iqbal, A.; Akhtar, E.; Ishfaq, M. EDDEEC: Enhanced Developed Distributed Energy-Efficient Clustering for Heterogeneous Wireless Sensor Networks. arXiv 2013, arXiv:1303.5274. [Google Scholar] [CrossRef]
  14. Behzadi, M.; Motameni, H.; Mohamadi, H.; Barzegar, B. Multi-Objective Energy-Efficient Clustering Protocol for Wireless Sensor Networks: An Approach Based on Metaheuristic Algorithms. IET Wirel. Sens. Syst. 2025, 15, e70011. [Google Scholar] [CrossRef]
  15. Heinzelman, W.R.; Chandrakasan, A.; Balakrishnan, H. Energy-efficient communication protocol for wireless microsensor networks. In Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, Maui, HI, USA, 7 January 2000; p. 10. [Google Scholar]
  16. Merabtine, N.; Djenouri, D.; Zegour, D.E. Towards energy efficient clustering in wireless sensor networks: A comprehensive review. IEEE Access 2021, 9, 92688–92705. [Google Scholar] [CrossRef]
  17. Ogundile, O.O.; Oloyede, M.O.; Osanaiye, O.A.; Falayi, E.O.; Okusanya, A.A. Selective-path clustered-based routing protocol for large scale wireless sensor networks. Int. J. Commun. Netw. Distrib. Syst. 2020, 25, 284–306. [Google Scholar] [CrossRef]
  18. Rawat, P. Particle Swarm Optimization-based energy-efficient clustering protocol in wireless sensor networks. Soft Comput. 2021, 33, 14147–14165. [Google Scholar] [CrossRef]
  19. Sharmin, S.; Ahmedy, I.; Md Noor, R. An energy-efficient data aggregation clustering algorithm for wireless sensor Networks using hybrid PSO. Energies 2023, 16, 2487. [Google Scholar] [CrossRef]
  20. Wang, K.; Zhao, X.; Shi, Y.; Xu, D.; Li, R. The energy-efficient MDA-SMAC protocol for wireless sensor networks. EURASIP J. Wirel. Commun. Netw. 2020, 2020, 32. [Google Scholar] [CrossRef]
  21. Nguyen, N.T.; Le, T.T.; Nguyen, H.H.; Voznak, M. Energy-efficient clustering multi-hop routing protocol in a UWSN. Sensors 2021, 21, 627. [Google Scholar] [CrossRef] [PubMed]
  22. Jasim, A.A.; Idris, M.Y.I.; Razalli Bin Azzuhri, S.; Issa, N.R.; Rahman, M.T.; Khyasudeen, M.F.b. Energy-efficient wireless sensor network with an unequal clustering protocol based on a balanced energy method (EEUCB). Sensors 2021, 21, 784. [Google Scholar] [CrossRef]
  23. Singh, S.P.; Sharma, S.C. A novel energy efficient clustering algorithm for wireless sensor networks. Eng. Technol. Appl. Sci. Res. 2017, 7, 1775–1780. [Google Scholar] [CrossRef]
  24. Zhao, L.; Qu, S.; Yi, Y. A modified cluster-head selection algorithm in wireless sensor networks based on LEACH. EURASIP J. Wirel. Commun. Netw. 2018, 2018, 287. [Google Scholar] [CrossRef]
  25. Liu, Y.; Wu, Q.; Zhao, T.; Tie, Y.; Bai, F.; Jin, M. An improved energy-efficient routing protocol for wireless sensor networks. Sensors 2019, 19, 4579. [Google Scholar] [CrossRef]
  26. Tian, K.; Zhou, C.; Zhang, J. Improved LEACH protocol based on underwater energy propagation model, parallel transmission, and replication computing for underwater acoustic sensor networks. Sensors 2024, 24, 556. [Google Scholar] [CrossRef] [PubMed]
  27. Mehta, D.; Saxena, S. MCH-EOR: Multi-objective cluster head based energy-aware optimized routing algorithm in wireless sensor networks. Sustain. Comput. Inform. Syst. 2020, 28, 100406. [Google Scholar] [CrossRef]
  28. Singh, S.K.; Kumar, P.; Singh, J.P. A survey on successors of LEACH protocol. IEEE Access 2017, 5, 4298–4328. [Google Scholar] [CrossRef]
  29. Sambhe, N.; Yenurkar, G.; Kanase, V.V.; Anjana, S.; Ninawe, N.; Babrekar, S.; Pophali, O.; Kale, A.; Vyas, P. A comparative analysis using LEACH protocol to enhance energy efficiency in wireless sensor networks with harmony search algorithm. Discov. Comput. 2025, 28, 2. [Google Scholar] [CrossRef]
  30. Mosavi, A.; Bahmani, A. Energy consumption prediction using machine learning: A review. Preprints 2019. [Google Scholar] [CrossRef]
  31. Sahoo, B.M.; Pandey, H.M.; Amgoth, T. A genetic algorithm inspired optimized cluster head selection method in wireless sensor networks. Swarm Evol. Comput. 2022, 75, 101151. [Google Scholar] [CrossRef]
  32. Saadallah, N.R.; Alabady, S.A.; Al-Turjman, F. Energy-efficient cluster head selection via genetic algorithm. Al-Rafidain Eng. J. (AREJ) 2024, 29, 12–25. [Google Scholar] [CrossRef]
  33. Bacanin, N.; Arnaut, U.; Zivkovic, M.; Bezdan, T.; Rashid, T.A. Energy efficient clustering in wireless sensor networks by opposition-based initialization bat algorithm. In Computer Networks and Inventive Communication Technologies: Proceedings of Fourth ICCNCT 2021; Springer: Berlin/Heidelberg, Germany, 2021; pp. 1–16. [Google Scholar]
  34. Khalilnasl, H.; Ghaffari, A. Cluster-based routing scheme for wireless sensor network using PSO and Firefly algorithms. Wirel. Pers. Commun. 2022, 122, 1231–1249. [Google Scholar]
  35. Gamal, M.; Mekky, N.E.; Soliman, H.; Hikal, N.A. Enhancing the lifetime of wireless sensor networks using fuzzy logic LEACH technique-based particle swarm optimization. IEEE Access 2022, 10, 36935–36948. [Google Scholar] [CrossRef]
  36. Hassan, A.A.h.; Shah, W.M.; Othman, M.F.I.; Hassan, H.A.H. Evaluate the performance of K-Means and the fuzzy C-Means algorithms to formation balanced clusters in wireless sensor networks. Int. J. Electr. Comput. Eng 2020, 10, 1515–1523. [Google Scholar] [CrossRef]
  37. Pal, R.; Saraswat, M.; Kumar, S.; Nayyar, A.; Rajput, P.K. Energy efficient multi-criterion binary grey wolf optimizer based clustering for heterogeneous wireless sensor networks. Soft Comput. 2024, 28, 3251–3265. [Google Scholar] [CrossRef]
  38. Sibi Amaran, D.R. Differential evolution with artificial bee colony optimization algorithm based sink hole detection in wireless sensor networks. Int. J. Emerg. Trends Eng. Res. 2020, 8, 1761–1767. [Google Scholar] [CrossRef]
  39. Khan, M.N.; Rahman, H.U.; Almaiah, M.A.; Khan, M.Z.; Khan, A.; Raza, M.; Al-Zahrani, M.; Almomani, O.; Khan, R. Improving energy efficiency with content-based adaptive and dynamic scheduling in wireless sensor networks. IEEE Access 2020, 8, 176495–176520. [Google Scholar] [CrossRef]
  40. Bandi, R.; Ananthula, V.R.; Janakiraman, S. Self adapting differential search strategies improved artificial bee colony algorithm-based cluster head selection scheme for WSNs. Wirel. Pers. Commun. 2021, 121, 2251–2272. [Google Scholar] [CrossRef]
  41. Luo, Y.; Yao, Y.; Shan, L. Analysis of ionospheric disturbances caused by the 2018 Bering Sea meteor explosion based on GPS observations. Sensors 2020, 20, 3201. [Google Scholar] [CrossRef]
  42. Kumar, N.; Singh, S. A review of energy-efficient clustering protocols in wireless sensor networks for environmental monitoring. J. Ambient. Intell. Humaniz. Comput. 2021, 12, 3797–3813. [Google Scholar]
  43. Ke, W.; Yangrui, O.; Hong, J.; Heli, Z.; Xi, L. Energy aware hierarchical cluster-based routing protocol for WSNs. J. China Univ. Posts Telecommun. 2016, 23, 46–52. [Google Scholar] [CrossRef]
  44. Abose, T.A.; Tekulapally, V.; Megersa, K.T.; Kejela, D.C.; Daka, S.T.; Jember, K.A. Improving wireless sensor network lifespan with optimized clustering probabilities, improved residual energy LEACH and energy efficient LEACH for corner-positioned base stations. Heliyon 2024, 10, e34382. [Google Scholar] [CrossRef] [PubMed]
  45. Ijemaru, G.K.; Ang, K.L.M.; Seng, J.K. Wireless power transfer and energy harvesting in distributed sensor networks: Survey, opportunities, and challenges. Int. J. Distrib. Sens. Netw. 2022, 18, 15501477211067740. [Google Scholar] [CrossRef]
  46. Tran, H.T.; Nguyen, C.V.; Nguyen, H.T.; Nguyen, M.T. Energy harvesting for devices in wireless sensor networks: A Review. EAI Endorsed Trans. Internet Things 2023, 9, 1–11. [Google Scholar] [CrossRef]
  47. Hasan, M.A.M.; Wang, Y.; Bowen, C.R.; Yang, Y. 2D nanomaterials for effective energy scavenging. Nano-Micro Lett. 2021, 13, 82. [Google Scholar] [CrossRef] [PubMed]
  48. Sharma, H.; Haque, A.; Jaffery, Z.A. Maximization of wireless sensor network lifetime using solar energy harvesting for smart agriculture monitoring. Ad Hoc Netw. 2019, 94, 101966. [Google Scholar] [CrossRef]
  49. Sudevalayam, S.; Kulkarni, P. Energy harvesting sensor nodes: Survey and implications. IEEE Commun. Surv. Tutor. 2010, 13, 443–461. [Google Scholar] [CrossRef]
  50. Liu, D.; Zhu, X.; Wang, Y. China’s agricultural green total factor productivity based on carbon emission: An analysis of evolution trend and influencing factors. J. Clean. Prod. 2021, 278, 123692. [Google Scholar] [CrossRef]
  51. Zakari, A.; Khan, I.; Tan, D.; Alvarado, R.; Dagar, V. Energy efficiency and sustainable development goals (SDGs). Energy 2022, 239, 122365. [Google Scholar] [CrossRef]
  52. Hou, L.; Chen, W. A novel MPPT method for autonomous wireless sensor networks node with thermal energy harvesting. Eng. Res. Express 2020, 2, 015005. [Google Scholar] [CrossRef]
  53. Wang, C.; Gu, J.; Martínez, O.S.; Crespo, R.G. Economic and environmental impacts of energy efficiency over smart cities and regulatory measures using a smart technological solution. Sustain. Energy Technol. Assessments 2021, 47, 101422. [Google Scholar] [CrossRef]
  54. Owusu-Manu, D.G.; Quaigrain, R.A.; Edwards, D.J.; Hammond, M.; Hammond, M.; Roberts, C. Energy conservation literacy among households in Sub-Sahara Africa. Int. J. Energy Sect. Manag. 2022, 16, 1130–1149. [Google Scholar] [CrossRef]
  55. Stivanello, P. Co-Benefits of Plus Energy Buildings: More Than Just Energy Efficiency to Advocate for Tomorrow’s Building Technology. Ph.D. Thesis, Università Ca’ Foscari Venezia, Venezia, Italy, 2021. Available online: https://unitesi.unive.it/retrieve/49005e13-2d5c-44a2-8503-caa6f15fb145/877129-1243601.pdf (accessed on 1 January 2023).
  56. Jaiswal, K.; Anand, V. A QoS aware optimal node deployment in wireless sensor network using Grey wolf optimization approach for IoT applications. Telecommun. Syst. 2021, 78, 559–576. [Google Scholar] [CrossRef]
  57. Saad, A.; Senouci, M.R.; Benyattou, O. Toward a realistic approach for the deployment of 3D Wireless Sensor Networks. IEEE Trans. Mob. Comput. 2020, 21, 1508–1519. [Google Scholar] [CrossRef]
  58. Dahmane, W.M.; Dollinger, J.F.; Ouchani, S. A bim-based framework for an optimal wsn deployment in smart building. In Proceedings of the 2020 11th International Conference on Network of the Future (NoF), Bordeaux, France, 12–14 October 2020; pp. 110–114. [Google Scholar] [CrossRef]
  59. Binh, H.T.T.; Hanh, N.T.; Nghia, N.D.; Dey, N. Metaheuristics for maximization of obstacles constrained area coverage in heterogeneous wireless sensor networks. Appl. Soft Comput. 2020, 86, 105939. [Google Scholar] [CrossRef]
  60. Metiaf, A.; Wu, Q. Wireless sensor network deployment optimization using reference-point-based non-dominated sorting approach (NSGA-III). J. Phys. Conf. Ser. 2019, 1284, 012063. [Google Scholar] [CrossRef]
  61. Hajjej, F.; Hamdi, M.; Ejbali, R.; Zaied, M. A new optimal deployment model of internet of things based on wireless sensor networks. In Proceedings of the 2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC), Tangier, Morocco, 24–28 June 2019; pp. 2092–2097. [Google Scholar]
  62. Ng, C.K.; Wu, C.H.; Ip, W.H.; Yung, K.L. A smart bat algorithm for wireless sensor network deployment in 3-D environment. IEEE Commun. Lett. 2018, 22, 2120–2123. [Google Scholar] [CrossRef]
  63. Wang, Z.; Qin, C.; Wan, B.; Song, W.W. A comparative study of common nature-inspired algorithms for continuous function optimization. Entropy 2021, 23, 874. [Google Scholar] [CrossRef]
  64. Huang, S.; He, L.; Si, X.; Zhang, Y.; Hao, P. An effective krill herd algorithm for numerical optimization. Int. J. Hybrid Inf. Technol. 2016, 9, 127–138. [Google Scholar] [CrossRef]
  65. Madhiarasan, M.; Deepa, S. ELMAN neural network with modified grey wolf optimizer for enhanced wind speed forecasting. Circuits Syst. 2016, 7, 2975. [Google Scholar] [CrossRef]
  66. Niyonteze, J.D.D.; Zou, F.; Asemota, G.N.O.; Nsengiyumva, W.; Hagumimana, N.; Huang, L.; Nduwamungu, A.; Bimenyimana, S. Applications of metaheuristic algorithms in solar air heater optimization: A review of recent trends and future prospects. Int. J. Photoenergy 2021, 2021, 6672579. [Google Scholar] [CrossRef]
  67. Li, Q.; Liu, S.Y.; Yang, X.S. Influence of initialization on the performance of metaheuristic optimizers. Appl. Soft Comput. 2020, 91, 106193. [Google Scholar] [CrossRef]
  68. Sharma, N.; Gupta, V. A comprehensive study of fractal clustering and firefly algorithm for WSN Deployment: Implementation and outcomes. MethodsX 2024, 13, 103030. [Google Scholar] [CrossRef]
  69. Ntabeni, U.; Basutli, B.; Alves, H.; Chuma, J. Improvement of the Low-Energy Adaptive Clustering Hierarchy Protocol in Wireless Sensor Networks Using Mean Field Games. Sensors 2024, 24, 6952. [Google Scholar] [CrossRef] [PubMed]
  70. Wang, H.; Liu, K.; Wang, C.; Hu, H. Energy-efficient, cluster-based routing protocol for wireless sensor networks using fuzzy logic and quantum annealing algorithm. Sensors 2024, 24, 4105. [Google Scholar] [CrossRef] [PubMed]
  71. Hussien, A.G.; Gharehchopogh, F.S.; Bouaouda, A.; Kumar, S.; Hu, G. Recent applications and advances of African vultures optimization algorithm. Artif. Intell. Rev. 2024, 57, 335. [Google Scholar] [CrossRef]
  72. Lakshmi, K.; Hossain, A.; Mummaneni, K. An improved 3D distributed clustering algorithm for underwater wireless sensors. Int. J. Inf. Technol. 2025, 17, 859–868. [Google Scholar] [CrossRef]
  73. Pravin, R.A.; Murugan, K.; Thiripurasundari, C.; Christodoss, P.R.; Puviarasi, R.; Lathif, S.I.A. Stochastic cluster head selection model for energy balancing in IoT enabled heterogeneous WSN. Meas. Sens. 2024, 35, 101282. [Google Scholar] [CrossRef]
  74. Abdollahzadeh, S.; Navimipour, N.J. Deployment strategies in the wireless sensor network: A comprehensive review. Comput. Commun. 2016, 91, 1–16. [Google Scholar] [CrossRef]
  75. Ghosh, A.; Das, S.K. Coverage and connectivity issues in wireless sensor networks: A survey. Pervasive Mob. Comput. 2008, 4, 303–334. [Google Scholar] [CrossRef]
  76. Adnan, M.A.; Razzaque, M.A.; Ahmed, I.; Isnin, I.F. Bio-mimic optimization strategies in wireless sensor networks: A survey. Sensors 2013, 14, 299–345. [Google Scholar] [CrossRef] [PubMed]
  77. Kulkarni, R.V.; Venayagamoorthy, G.K. Bio-inspired algorithms for autonomous deployment and localization of sensor nodes. IEEE Trans. Syst. Man Cybern. Part C (Appl. Rev.) 2010, 40, 663–675. [Google Scholar] [CrossRef]
  78. Wang, J.; Zhong, N. Efficient point coverage in wireless sensor networks. J. Comb. Optim. 2006, 11, 291–304. [Google Scholar] [CrossRef]
  79. Rebai, M.; Snoussi, H.; Hnaien, F.; Khoukhi, L. Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks. Comput. Oper. Res. 2015, 59, 11–21. [Google Scholar] [CrossRef]
  80. Rawat, P.; Singh, K.D.; Chaouchi, H.; Bonnin, J.M. Wireless sensor networks: A survey on recent developments and potential synergies. J. Supercomput. 2013, 68, 1–48. [Google Scholar] [CrossRef]
  81. Joseph, A.J.; Asaletha, R.; Manoj, V.; Nishanth, R. An Enhanced PSO-Based Energy Efficient Clustering Routing Algorithm for Wireless Sensor Network. In Proceedings of the International Conference on Artificial Intelligence of Things, Chandigarh, India, 30–31 March 2023; pp. 99–112. [Google Scholar]
  82. Zachariah, U.E.; Kuppusamy, L. A hybrid approach to energy efficient clustering and routing in wireless sensor networks. Evol. Intell. 2022, 15, 593–605. [Google Scholar] [CrossRef]
  83. Tay, M.; Senturk, A. A new energy-aware cluster head selection algorithm for wireless sensor networks. Wirel. Pers. Commun. 2022, 122, 2235–2251. [Google Scholar] [CrossRef]
  84. Vimal, V.; Singh, K.U.; Kumar, A.; Gupta, S.K.; Rashid, M.; Saket, R.; Padmanaban, S. Clustering isolated nodes to enhance network’s life time of WSNs for IoT applications. IEEE Syst. J. 2021, 15, 5654–5663. [Google Scholar] [CrossRef]
  85. Hassan, A.A.H.; Shah, W.M.; Habeb, A.H.H.; Othman, M.F.I.; Al-Mhiqani, M.N. An improved energy-efficient clustering protocol to prolong the lifetime of the WSN-based IoT. IEEE Access 2020, 8, 200500–200517. [Google Scholar] [CrossRef]
  86. Priyadarshi, R.; Gupta, B.; Anurag, A. Deployment techniques in wireless sensor networks: A survey, classification, challenges, and future research issues. J. Supercomput. 2020, 76, 7333–7373. [Google Scholar] [CrossRef]
  87. Roberts, M.K.; Ramasamy, P. Optimized hybrid routing protocol for energy-aware cluster head selection in wireless sensor networks. Digit. Signal Process. 2022, 130, 103737. [Google Scholar] [CrossRef]
  88. Hassan, E.S.; Madkour, M.; Soliman, S.E.; Oshaba, A.S.; El-Emary, A.; Ali, E.S.; El-Samie, F.E.A. Energy-Efficient Data Fusion in WSNs Using Mobility-Aware Compression and Adaptive Clustering. Technologies 2024, 12, 248. [Google Scholar] [CrossRef]
  89. Wan, R.; Xiong, N.; Loc, N.T. An energy-efficient sleep scheduling mechanism with similarity measure for wireless sensor networks. Hum.-Centric Comput. Inf. Sci. 2018, 8, 18. [Google Scholar] [CrossRef]
  90. Cao, B.; Zhao, J.; Lv, Z.; Liu, X. A distributed parallel cooperative coevolutionary multiobjective evolutionary algorithm for large-scale optimization. IEEE Trans. Ind. Inform. 2017, 13, 2030–2038. [Google Scholar] [CrossRef]
  91. Kumar, S.; Prateek, M.; Ahuja, N.J.; Bhushan, B. DE-LEACH: Distance and Energy Aware LEACH. arXiv 2014, arXiv:1408.2914. [Google Scholar] [CrossRef]
  92. Meguerdichian, S.; Koushanfar, F.; Potkonjak, M.; Srivastava, M.B. Coverage problems in wireless ad-hoc sensor networks. In Proceedings of the Proceedings IEEE INFOCOM 2001, Conference on Computer Communications, Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No. 01CH37213), Anchorage, AK, USA,, 22–26 April 2001; Volume 3, pp. 1380–1387. [Google Scholar]
  93. Behera, T.M.; Mohapatra, S.K.; Samal, U.C.; Khan, M.S.; Daneshmand, M.; Gandomi, A.H. Residual Energy Based Cluster-head Selection in WSNs for IoT Application. arXiv 2019, arXiv:1902.01445. [Google Scholar] [CrossRef]
  94. John, J.; Rodrigues, P. A survey of energy-aware cluster head selection techniques in wireless sensor network. Evol. Intell. 2022, 15, 1109–1121. [Google Scholar] [CrossRef]
  95. Holland, J.H. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence; MIT Press: Cambridge, MA, USA, 1992. [Google Scholar]
  96. Heinzelman, W.B.; Chandrakasan, A.P.; Balakrishnan, H. An application-specific protocol architecture for wireless microsensor networks. IEEE Trans. Wirel. Commun. 2002, 1, 660–670. [Google Scholar] [CrossRef]
  97. Kamble, A.; Patil, B. Selection of Cluster Head Techniques in WSN: A Review. In Proceedings of the 2nd International Conference on IoT, Social, Mobile, Analytics & Cloud in Computational Vision & Bio-Engineering (ISMAC-CVB 2020), Tiruchengode, Tamil Nadu, India, 29–30 October 2020. [Google Scholar]
  98. Roeva, O.; Fidanova, S.; Paprzycki, M. Population size influence on the genetic and ant algorithms performance in case of cultivation process modeling. In Proceedings of the Recent Advances in Computational Optimization: Results of the Workshop on Computational Optimization WCO 2013, Kraków, Poland, 8–11 September 2013; pp. 107–120. [Google Scholar] [CrossRef]
  99. Alnajjar, A.B.; Kadim, A.M.; Jaber, R.A.; Hasan, N.A.; Ahmed, E.Q.; Altaei, M.S.M.; Khalaf, A.L. Wireless sensor network optimization using genetic algorithm. J. Robot. Control (JRC) 2022, 3, 827–835. [Google Scholar] [CrossRef]
  100. Kumar, S.; Kumar, V.; Kaiwartya, O.; Dohare, U.; Kumar, N.; Lloret, J. Towards green communication in wireless sensor network: GA enabled distributed zone approach. Ad Hoc Netw. 2019, 93, 101903. [Google Scholar] [CrossRef]
  101. Luomala, J.; Hakala, I. Effects of Temperature and Humidity on Radio Signal Strength in Outdoor Wireless Sensor Networks. In Proceedings of the Federated Conference on Computer Science and Information Systems (FedCSIS), Lodz, Poland, 13–16 September 2015; pp. 1247–1255. [Google Scholar]
  102. Markham, A.; Trigoni, N.; Ellwood, S. Effect of Rainfall on Link Quality in an Outdoor Forest Deployment. In Proceedings of the 6th International Conference on Wireless On-Demand Network Systems and Services, Athens, Greece, 26–28 July 2007; pp. 1–6. [Google Scholar]
Figure 1. Internal components of a typical wireless sensor node.
Figure 1. Internal components of a typical wireless sensor node.
Sensors 25 05250 g001
Figure 2. Conceptual 2D projection of sensor node deployment illustrating sensing ranges, overlapping coverage zones, and gaps. This view simplifies spatial understanding before transitioning to 3D deployment.
Figure 2. Conceptual 2D projection of sensor node deployment illustrating sensing ranges, overlapping coverage zones, and gaps. This view simplifies spatial understanding before transitioning to 3D deployment.
Sensors 25 05250 g002
Figure 3. 3D sensor deployment in forested terrain.
Figure 3. 3D sensor deployment in forested terrain.
Sensors 25 05250 g003
Figure 4. Radio energy dissipation model showing energy cost for transmission and reception in WSN nodes.
Figure 4. Radio energy dissipation model showing energy cost for transmission and reception in WSN nodes.
Sensors 25 05250 g004
Figure 5. Logical flow of the proposed EEL-GA algorithm showing LEACH-based clustering, genetic optimization, and reclustering triggered based on CH energy and communication distance.
Figure 5. Logical flow of the proposed EEL-GA algorithm showing LEACH-based clustering, genetic optimization, and reclustering triggered based on CH energy and communication distance.
Sensors 25 05250 g005
Figure 6. Clustered WSN communication topology under EEL-GA: sensor nodes (red circles), cluster heads (blue diamonds), intra-cluster communication (black dashed lines), inter-cluster communication (yellow dashed lines), and CH-to-sink routing (green dashed lines).
Figure 6. Clustered WSN communication topology under EEL-GA: sensor nodes (red circles), cluster heads (blue diamonds), intra-cluster communication (black dashed lines), inter-cluster communication (yellow dashed lines), and CH-to-sink routing (green dashed lines).
Sensors 25 05250 g006
Figure 7. Scheduling overhead vs. node density.
Figure 7. Scheduling overhead vs. node density.
Sensors 25 05250 g007
Figure 8. Residual energy vs. node density.
Figure 8. Residual energy vs. node density.
Sensors 25 05250 g008
Figure 9. Cluster lifetime vs. number of clusters.
Figure 9. Cluster lifetime vs. number of clusters.
Sensors 25 05250 g009
Figure 10. Average transmission delay vs. node density.
Figure 10. Average transmission delay vs. node density.
Sensors 25 05250 g010
Figure 11. Packet delivery ratio vs. node density.
Figure 11. Packet delivery ratio vs. node density.
Sensors 25 05250 g011
Table 1. Comparison of energy efficiency and energy harvesting in WSNs.
Table 1. Comparison of energy efficiency and energy harvesting in WSNs.
AspectEnergy Efficiency (EE)Energy Harvesting (EH)
Operational StabilityOffers consistent performance regardless of external factors [51]Highly dependent on environmental conditions, like solar or wind availability [48]
Hardware RequirementsLower hardware complexity, based on standard microcontrollers and sensors [52]Requires additional circuits for MPPT, energy storage, and regulators [52]
Economic ViabilityFaster return on investment; reduced energy bills and maintenance [53]Higher upfront cost; cost-effective only in long-term and specific conditions [46]
Environmental BenefitsIndirectly reduces carbon footprint through lowered energy use [50]Offers green energy collection, but effectiveness varies [48]
Implementation ScalabilityScalable in urban and remote settings, without reliance on ambient energy [54]Limited scalability in shaded, enclosed, or indoor deployments [46]
Suitability for WSNsSuitable for mission-critical and delay-sensitive WSN applications [52]Best suited as a backup energy source, not as a primary power strategy [48]
Table 2. WSN deployment optimization techniques.
Table 2. WSN deployment optimization techniques.
AuthorYearObjectivesOptimization Method
[56]2022Maximize Coverage, Connectivity, Minimize CostGray Wolf Optimization
[57]2020Coverage, Cost, ConnectivityNSGA-II
[58]2020Coverage, Cost, ConnectivityNSGA-II
[59]2020Coverage, ConnectivityGA, PSO
[60]2019Coverage, Network Lifetime, ConnectivityNSGA-III
[61]2019Coverage, Lifetime, Energy Dissipation, ConnectivityMOPFA
[62]2018Lifetime, Cost, Fault Tolerance, ConnectivitySmart Bat Algorithm
Table 4. Simulation parameters for EEL-GA in 3D WSN.
Table 4. Simulation parameters for EEL-GA in 3D WSN.
ParameterValue
Number of nodes200
Network size1000 m × 1000 m × 1000 m
Base station position(500, 500, 500) m
Initial energy per node 0.5 ± 0.5 J
Packet size1000–4000 bits
CH selection probability (p)0.04
Rounds simulated11 (initial analysis, extendable for long-term evaluation)
GA population size10
Data aggregation energy ( E D A )5 nJ/bit
Tx/Rx energy ( E e l e c )50 nJ/bit
Free space energy ( E f s )10 pJ/bit/m2
Multipath energy ( E m p )0.0013 pJ/bit/m4
Environmental conditionsReal dataset
Deployment typeRandomized 3D probabilistic
Table 5. Simulation parameters and justifications.
Table 5. Simulation parameters and justifications.
ParameterDescriptionValue / Justification
α Weight for residual energy in fitness0.6 (empirically tuned)
GA population sizeNumber of chromosomes10 (resource-aware trade-off)
Max generationsNumber of GA iterations30 (converged within limit)
CH selection probability pLEACH-based CH percentage0.05 (standard in WSN)
Table 6. Environmental variables and EEL-GA adaptation strategies.
Table 6. Environmental variables and EEL-GA adaptation strategies.
Environmental FactorWSN ImpactEEL-GA Adaptation
TemperatureAccelerated battery depletion and reduced signal strength [101]Dynamic adjustment of node duty cycles and transmission power
HumiditySignal attenuation and increased packet loss [101]Selection of alternative routing paths and link-quality-based clustering
PrecipitationElevated risk of node failure and path loss [102]Activation of redundant nodes and rerouting to maintain connectivity
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Batool, F.; Ali, K.; Lasebae, A.; Windridge, D.; Kiyani, A. EEL-GA: An Evolutionary Clustering Framework for Energy-Efficient 3D Wireless Sensor Networks in Smart Forestry. Sensors 2025, 25, 5250. https://doi.org/10.3390/s25175250

AMA Style

Batool F, Ali K, Lasebae A, Windridge D, Kiyani A. EEL-GA: An Evolutionary Clustering Framework for Energy-Efficient 3D Wireless Sensor Networks in Smart Forestry. Sensors. 2025; 25(17):5250. https://doi.org/10.3390/s25175250

Chicago/Turabian Style

Batool, Faryal, Kamran Ali, Aboubaker Lasebae, David Windridge, and Anum Kiyani. 2025. "EEL-GA: An Evolutionary Clustering Framework for Energy-Efficient 3D Wireless Sensor Networks in Smart Forestry" Sensors 25, no. 17: 5250. https://doi.org/10.3390/s25175250

APA Style

Batool, F., Ali, K., Lasebae, A., Windridge, D., & Kiyani, A. (2025). EEL-GA: An Evolutionary Clustering Framework for Energy-Efficient 3D Wireless Sensor Networks in Smart Forestry. Sensors, 25(17), 5250. https://doi.org/10.3390/s25175250

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop