Node Death Research Articles

Energy-saving clustering routing algorithm for heterogeneous wireless sensor networks based on energy iteration model and bee colony optimization

Aiming at the problems of large number of data transmission node deaths and large transmission energy consumption output in energy-saving clustering routing communication of wireless sensor networks, an energy-saving clustering routing algorithm for heterogeneous wireless sensor networks based on energy iteration model and bee colony optimization is proposed. Firstly, a network communication energy consumption model is constructed, and the network node distribution is optimized in time with the goal of reducing energy consumption combined with differential bee colony algorithm; then, based on the network node distribution optimization results, an energy-saving clustering method for heterogeneous wireless sensor networks is formulated, and the cluster head is determined by using the energy iteration cluster selection method, and the cluster head radius is obtained to complete the energy-saving clustering of communication nodes in heterogeneous wireless sensor networks; finally, the distance between the communication cluster head node and the base station is set, the routing level of the node communication is determined, and the energy-saving routing communication of the heterogeneous wireless sensor network is realized by combining the multi-hop routing communication mode. The experimental results show that when the method is used for network energy-saving clustering routing communication, the number of data transmission nodes that die is at most 22, and the maximum energy consumption of node transmission is 21 nJ/bit , indicating that the node communication energy-saving effect of this method is good.

Charging Scheduling Method for Wireless Rechargeable Sensor Networks Based on Energy Consumption Rate Prediction for Nodes.

With the development of the IoT, Wireless Rechargeable Sensor Networks (WRSNs) derive more and more application scenarios with diverse performance requirements. In scenarios where the energy consumption rate of sensor nodes changes dynamically, most existing charging scheduling methods are not applicable. The incorrect estimation of node energy requirement may lead to the death of critical nodes, resulting in missing events. To address this issue, we consider both the spatial imbalance and temporal dynamics of the energy consumption of the nodes, and minimize the Event Missing Rate (EMR) as the goal. Firstly, an Energy Consumption Balanced Tree (ECBT) construction method is proposed to prolong the lifetime of each node. Then, we transform the goal into Maximizing the value of the Evaluation function of each node's Energy Consumption Rate prediction (MEECR). Afterwards, the setting of the evaluation function is explored and the MEECR is further transformed into a variant of the knapsack problem, namely "the alternating backpack problem", and solved by dynamic programming. After predicting the energy consumption rate of the nodes, a charging scheduling scheme that meets the Dual Constraints of Nodes' energy requirements and MC's capability (DCNM) is developed. Simulations demonstrate the advantages of the proposed method. Compared to the baselines, the EMR was reduced by an average of 35.2% and 26.9%.

Energy efficient clustering and sink mobility protocol using Improved Dingo and Boosted Beluga Whale Optimization Algorithm for extending network lifetime in WSNs

In Wireless Sensor Networks (WSNs), the potential design challenge of energy efficiency is determined to be handled through the strategies of clustering and routing. The approaches of clustering and routing in WSNs pertain to the problems of Non-deterministic Polynomial (NP)-hard optimization. In this context, swarm intelligence-based algorithms are identified to be suitable and ideal for determining near-optimal and optimal solutions in the search space. On the other hand, APTEEN routing protocol possesses the issues that are related to unnecessary energy drain, ineffective overall network coverage and premature death of certain nodes. To address these issues, an attempt to optimize the APTEEN routing protocol using Dingo Optimization Algorithm (DOA) and Beluga Whale Optimization Algorithm (BWOA) is made in this proposed clustering protocol. With this motivation, Improved Dingo and Boosted Beluga Whale Optimization Algorithm (IDBBWOA) is proposed for determining the optimal cluster head and perform energy-efficient routing to minimized the energy consumption and maximize the lifetime of the network. It specifically used Improved Dingo Optimization Algorithm (IDOA) for attaining cluster head (CH) selection and energy efficient routing through the adoption fitness parameters of Residual Energy, Distance within and between Clusters, Network coverage, Node Degree for maximizing the rate of reliable data dissemination. It also incorporated Boosted Beluga Whale Optimization Algorithm (BBWOA) for determining the optimal points over the sink node can be moved to prevent multi-hop between CHs and the sink nodes, since it is essential for addressing the issue of hot-spot and extends the network lifetime. The simulation results of the proposed IDBBWOA approach revealed its efficacy in improving the mean throughput by 18.92 %, sustaining alive nodes by 34.28 %, and maintaining residual energy by 29.34 %, compared to the benchmarked approaches used for evaluation.

Hot‐spot aware multicost‐based energy‐efficient routing protocol for WBANs

SummaryWireless body area networks (WBANs) are becoming widely considered in remote healthcare monitoring applications. However, WBAN nodes have limited resources; therefore, effective and reliable routing protocols are pivotal research challenges. Furthermore, balancing the traffic load among sensor nodes is also highly required to increase network stability. In recent years, many interesting routing solutions have been proposed for WBANs; however, the significant feature in terms of stability and energy in these solutions has not been sufficiently addressed. Therefore, in this context, the Hot‐Sspot Aaware Multicost‐based Energy‐efficient Routing (H‐SAMER) protocol is proposed in this paper. The suggested protocol used multieffective cost function for next‐hop node selection based on the data type, where the patient's data are categorized into three classes: normal data, on‐demand data, and emergency data. Furthermore, the H‐SAMER protocol adds awareness to the transmission of control packets by adding the cost value to the RREQ packets. Thus, the simulation scenario shows that the H‐SAMER saves energy 8.57%, 88%, 98%, 97%, and 100% greater than E‐HARP, EH‐RCP, CO‐LAEEBA, EECBSR, and ELR‐W, respectively. Moreover, the first node death of the proposed H‐SAMER is delayed to round number 7500, which proves H‐SAMER to be a stable and reliable effective solution for WBANs.

An efficient dual layer data aggregation scheme in clustered wireless sensor networks

AbstractIn wireless sensor network (WSN) monitoring systems, redundant data from sluggish environmental changes and overlapping sensing ranges can increase the volume of data sent by nodes, degrade the efficiency of information collection, and lead to the death of sensor nodes. To reduce the energy consumption of sensor nodes and prolong the life of WSNs, this study proposes a dual layer intracluster data fusion scheme based on ring buffer. To reduce redundant data and temporary anomalous data while guaranteeing the temporal coherence of data, the source nodes employ a binarized similarity function and sliding quartile detection based on the ring buffer. Based on the improved support degree function of weighted Pearson distance, the cluster head node performs a weighted fusion on the data received from the source nodes. Experimental results reveal that the scheme proposed in this study has clear advantages in three aspects: the number of remaining nodes, residual energy, and the number of packets transmitted. The data fusion of the proposed scheme is confined to the data fusion of the same attribute environment parameters.

Deep-Reinforcement-Learning-Based Joint Energy Replenishment and Data Collection Scheme for WRSN.

With the emergence of wireless rechargeable sensor networks (WRSNs), the possibility of wirelessly recharging nodes using mobile charging vehicles (MCVs) has become a reality. However, existing approaches overlook the effective integration of node energy replenishment and mobile data collection processes. In this paper, we propose a joint energy replenishment and data collection scheme (D-JERDG) for WRSNs based on deep reinforcement learning. By capitalizing on the high mobility of unmanned aerial vehicles (UAVs), D-JERDG enables continuous visits to the cluster head nodes in each cluster, facilitating data collection and range-based charging. First, D-JERDG utilizes the K-means algorithm to partition the network into multiple clusters, and a cluster head selection algorithm is proposed based on an improved dynamic routing protocol, which elects cluster head nodes based on the remaining energy and geographical location of the cluster member nodes. Afterward, the simulated annealing (SA) algorithm determines the shortest flight path. Subsequently, the DRL model multiobjective deep deterministic policy gradient (MODDPG) is employed to control and optimize the UAV instantaneous heading and speed, effectively planning UAV hover points. By redesigning the reward function, joint optimization of multiple objectives such as node death rate, UAV throughput, and average flight energy consumption is achieved. Extensive simulation results show that the proposed D-JERDG achieves joint optimization of multiple objectives and exhibits significant advantages over the baseline in terms of throughput, time utilization, and charging cost, among other indicators.

Data aggregation algorithm for wireless sensor networks with different initial energy of nodes.

Data aggregation plays a critical role in sensor networks for efficient data collection. However, the assumption of uniform initial energy levels among sensors in existing algorithms is unrealistic in practical production applications. This discrepancy in initial energy levels significantly impacts data aggregation in sensor networks. To address this issue, we propose Data Aggregation with Different Initial Energy (DADIE), a novel algorithm that aims to enhance energy-saving, privacy-preserving efficiency, and reduce node death rates in sensor networks with varying initial energy nodes. DADIE considers the transmission distance between nodes and their initial energy levels when forming the network topology, while also limiting the number of child nodes. Furthermore, DADIE reconstructs the aggregation tree before each round of data transmission. This allows nodes closer to the receiving end with higher initial energy to undertake more data aggregation and transmission tasks while limiting energy consumption. As a result, DADIE effectively reduces the node death rate and improves the efficiency of data transmission throughout the network. To enhance network security, DADIE establishes secure transmission channels between transmission nodes prior to data transmission, and it employs slice-and-mix technology within the network. Our experimental simulations demonstrate that the proposed DADIE algorithm effectively resolves the data aggregation challenges in sensor networks with varying initial energy nodes. It achieves 5-20% lower communication overhead and energy consumption, 10-20% higher security, and 10-30% lower node mortality than existing algorithms.

A Wi-Fi dynamic routing algorithm based on energy prediction for wildlife monitoring wireless network

The routing protocol of wildlife monitoring Wi-Fi (Wireless Fidelity) networks cannot balance node energy consumption, leading to early node death. Therefore, the research on energy balance in wildlife monitoring Wi-Fi networks is a hot topic. In order to balance the energy consumption of Wi-Fi networks and extend the lifespan of wireless networks, we designed the low energy dynamic routing protocol LEACH-EP (Low Energy Adaptive Clustering Hierarchy- Energy Prediction) based on energy prediction by analyzing the long-range dependent characteristics of the remaining energy time series (RETS) of wireless network nodes. This protocol uses the LSTM (Long Short-Term Memory) model to predict the remaining energy of network nodes, and then dynamically plans routes using future remaining energy. We conducted a networking experiment in the Anzihe Nature Reserve in Chengdu, China, and the Energy Balance Factor index of the wireless network significantly improved. The Mean Absolute Error value of network nodes is less than 60 mW, which is less than 10% of the average daily energy consumption of nodes. Half of the surviving network nodes have achieved an increase to 55.2%, and the network death time has been extended by 38.6%. The experimental results show that the energy prediction routing protocol LEACH-EP can significantly extend the node survival life and balance network energy consumption.

An energy efficiency routing protocol for UAV-aided WSNs data collection

In recent years, Unmanned Aerial Vehicle (UAV)-aided Wireless Sensor Networks (WSNs) have become a hot research topic. The routing protocol is a crucial technology for data transmission in UAV-WSNs. In this paper, we propose an efficient routing protocol for UAV-WSNs data collection to address the high energy consumption and premature death of some sensor nodes (SNs) caused by existing routing protocols. Firstly, the UAV-WSNs data collection framework is established, and a UAV communication coverage model is derived. Secondly, according to the data transmission link, we preliminarily divide the routing area into air-to-ground routing area and ground-to-ground routing area. Based on this, a multi-hop routing protocol based on unequal-sized clustering is proposed to promote the balance of energy consumption between clusters. Then, we propose a sector dynamic adjustment strategy inspired by lottery turntable wheels, which dynamically adjusts the member nodes in each cluster by simulating a rotation to ensure the balance of energy consumption between SNs in the cluster. Finally, the feasibility and efficiency of the proposed protocol are verified through simulation and comparative experiments.

A Design Study on the Design of Customer Claims Management System for Qinghai Electric Power Company

Abstract This paper utilizes the SOA framework to realize the system structure design, combined with the total flow of the claim processing, the design of the acceptance and audit processing, responsibility determination and reminder management of 4 modules, constituting the customer claim management system as a whole. The improved LEACH algorithm is utilized to control the network topology, and the cluster tree combined with data fusion is used to reduce the energy loss of the nodes in the network. Based on the weighted queuing scheduling algorithm, the feedback processing module is designed to determine the grouping rules and calculation methods, and the decision tree algorithm is used to build the demand management prediction model. The accuracy of the prediction of the decision tree algorithm is verified to realize the case information management statistics. Analyze the utility of the improved LEACH algorithm and test the system’s performance. The experimental results show that the improved LEACH algorithm is more balanced in the range of [0,100] dead nodes, and the energy consumption is well balanced. The total delay is 16.13-time slots, which is the lowest delay among the four algorithms. The node death time is 1045 rounds, having the longest network life cycle. The system performance is tested using IO and memory-intensive loads. Before writing a file of 16GB, the system time responsiveness stays around 80%, and the system CPU utilization and disk IO utilization increase as the file is written. The system performance is good.

On the Best Fitness Function for the WSN Lifetime Maximization: A Solution Based on a Modified Salp Swarm Algorithm for Centralized Clustering and Routing

Wireless sensor networks (WSNs) have become increasingly important in recent years due to their ability to monitor and collect data in various environments. However, WSNs are often limited by their energy resources, making energy efficiency a critical concern in designing WSNs. Clustering and multi-hop routing are effective methods for maximizing the lifetime of WSNs. The energy efficient clustering and routing problem in WSNs can be formulated as a multi-dimensional knapsack problem (d-kp). This formulation can generalize all clustering and routing protocols in regard to energy efficiency. In this paper, we investigate the hardness of the energy-efficient clustering and routing problem in WSNs based on the d-kp formulation and introduce a modified Salp Swarm Algorithm (SSA) as a method to solve this problem. SSA is a metaheuristic algorithm inspired by the behavior of salps in the ocean. Moreover, we prove that it is impossible to design a polynomial time fitness function to maximize a long-term metric such as FND (time of first node death), which is a commonly used metric for network lifetime. Our results have implications for the design of energy-efficient WSNs and call for the development of more efficient algorithms that can handle the complexity of this problem. furthermore, we evaluate our proposed algorithm using simulation and compare it to existing algorithms. Our results show that using SSA with a carefully designed fitness function based on the theoretical findings and a unique one-to-one routing protocol to mitigate the energy hole problem, outperforms many of the existing algorithms in terms of energy efficiency and network lifetime.

A WSN clustering routing method based on an improved WOA-optimized K-means clustering algorithm

To address the problem of transmission energy consumption and premature node death in wireless sensor networks (WSN), a novel routing strategy by IWOA that optimizes the K-means (KM) is proposed. WOA is improved by using it to optimize the KM algorithm, and more evenly distributed and suitable cluster centers are selected as the initial cluster heads (CH). In the CH election process, a CH election function is established, and the optimal CH under the influence of multiple factors is obtained. The simulation results have verified the feasibility of the proposed scheme in this paper.

LEACH-D: A low-energy, low-delay data transmission method for industrial internet of things wireless sensors

In recent years, the Internet of Things (IoT) has experienced extensive adoption in industrial environments, healthcare, smart cities, and more, playing a vital role in these domains. Within IoT-based systems, wireless sensor networks (WSNs) have emerged as a crucial method for collecting peripheral environmental data within industries, owing to their self-organizational attributes. Nevertheless, the enormous volume of heterogeneous data from various sensing devices presents many challenges for IoT-enabled WSNs, encompassing high transmission delay times (TD) and excessive battery energy consumption (EC). To address these challenges, it is imperative to prioritize efficiency and optimize energy utilization. Moreover, enhancing energy efficiency within the Industrial Internet of Things (IIoT) realm hinges significantly on factors such as data transmission modes and the allocation of cluster head nodes. Numerous researchers have proposed algorithms to minimize transmission time and energy consumption, specifically focusing on industrial environments. This paper introduces an inventive clustering-based data transmission algorithm for IIoT, LEACH-D, to enhance efficiency. The LEACH-D algorithm improves the transmission task duration while maintaining consistent battery energy consumption. It also seeks to elevate performance in metrics such as average transmission time during the first node death (FND). Numerous experimental results provide strong evidence that the algorithm introduced in this paper has effectively reduced the average transmission time by remarkable percentages: 51.32%, 12.12%, 12.96%, and 5.42%, while simultaneously increasing the number of FND rounds by significant margins: 222.43%, 36.63%, 33.72%, and 7.81%, respectively. These improvements stand in stark contrast to the performance of existing algorithms, including FREE_MODE, LEACH, EE-LEACH, and ETH-LEACH.

Energy-Efficient Improved Optimal K-Means: Dynamic Cluster Head Selection based on Delaying the First Node Death in MWSN-IoT

The Internet of Things (IoT), which attaches dynamic devices that can access the Internet to create a smart environment, is a tempting research area. IoT-based mobile wireless sensor networks (WSN-IoT) are one of the major databases from which the IoT collects data for analysis and interpretation. However, one of the critical constraints is network lifetime. Routing-based clustered protocols and cluster head (CH) selection are crucial in load balancing and sensor longevity. Yet, with clustering, sensor node mobility requires more overhead because the nodes close to the center may get far and thus become unsuitable to be a CH, whereas those far from the center may get close and become good CH candidates, influencing energy consumption. This paper suggests an energy-efficient clustering protocol with a dynamic cluster head selection considering the distance to the cluster center, remaining energy, and each node's mobility degree implementing a rotation mechanism that allows cluster members to be equally elected while prioritizing those with the minimum weight. The advised algorithm aims to delay the first node death (FND) and thus prolong the stability period and minimize energy consumption by avoiding re-clustering. The performance of the proposed protocol exceeds that achieved in our previous work, Improved OKmeans, by 11%, in first dead node lifetime maximization, 43% in throughput, and 44% in energy efficiency.

BAT: Barabasi–Albert With Topsis Scale-Free Topology Evolution for Load-Balanced WSNs

Recent advancements in sensor technology have made Wireless Sensor Networks (WSNs) a preferable choice for several applications. As sensor nodes rely on limited batteries in order to operate, clustering techniques are proven to be energy efficient and effective in the case of WSNs. Avoiding premature death of sensor nodes by load balancing and prolonging network lifetime is an essential aspect that needs to be addressed. Hence there is always a need for protocol that can uniformly evolve energy consumption among all the nodes by load balancing the network with respect to energy. This work presents a clustering framework, named as BAT, that uses Barabasi-Albert (BA) model and Topsis (T) technique to effectively balance the load on all the sensor nodes present in the network. In the proposed BAT approach, network backbone topology is initially constructed, and later topology evolution happens according to the BA model. After network evolution, the best possible attachments are retained in order to form the final network. Best possible Cluster Heads (CHs) are determined by the weighted-objective function. The outcome of the proposed BAT protocol is evenly consumed energy among nodes over the whole network to avoid the energy hole. The simulation results reveal that the proposed approach has attained a better stable region and balanced energy efficient consumption when compared to other simulated protocols.

A Design and Challenges in Energy Optimizing CR-Wireless Sensor Networks

Background: The progress of the Cognitive Radio-Wireless Sensor Network is being influenced by advancements in wireless sensor networks (WSNs), which significantly have unique features of cognitive radio technology (CR-WSN). Enhancing the network lifespan of any network requires better utilization of the available spectrum as well as the selection of a good routing mechanism for transmitting informational data to the base station from the sensor node without data conflict. Aims: Cognitive radio methods play a significant part in achieving this, and when paired with WSNs, the above-mentioned objectives can be met to a large extent. Methods:: A unique energy-saving Distance- Based Multi-hop Clustering and Routing (DBMCR) methodology in association with spectrum allocation is proposed as a heterogeneous CR-WSN model. The supplied heterogeneous CR-wireless sensor networks are separated into areas and assigned a different spectrum depending on the distance. Information is sent over a multi-hop connection after dynamic clustering using distance computation. Results: The findings show that the suggested method achieves higher stability and ensures the energy-optimizing CR-WSN. The enhanced scalability can be seen in the First Node Death (FND). Additionally, the improved throughput helps to preserve the residual energy of the network which helps to address the issue of load balancing across nodes. Conclusions: Thus, the result acquired from the above findings shows that the proposed heterogeneous model achieves the enhanced network lifetime and ensures the energy optimizing CR-WSN.

Investigation and Analysis on Energy Efficient Stable Election Protocol (SEP) for WSN

Abstract: We study the impact of heterogeneity of nodes, in terms of their energy, in wireless sensor networks that are hierarchically clustered. In these networks some of the nodes become cluster heads, aggregate the data of their cluster members and transmit it to the sink. We assume that a percentage of the population of sensor nodes is equipped with additional energy resources—this is a source of heterogeneity which may result from the initial setting or as the operation of the network evolves. We propose SEP, a heterogeneous-aware protocol to prolong the time interval before the death of the first node (we refer to as stability period), which is crucial for many applications where the feedback from the sensor network must be reliable. SEP is based on weighted election probabilities of each node to become cluster head according to the remaining energy in each node. We show by simulation that SEP always prolongs the stability period compared to (and that the average throughput is greater than) the one obtained using current clustering protocols. We conclude by studying the sensitivity of our SEP protocol to heterogeneity parameters capturing energy imbalance in the network. We found that SEP yields longer stability region for higher values of extra energy brought by more powerful nodes. Sensor nodes usually have limited energy supply and they are impractical to recharge. How to balance traffic load in sensors in order to increase network lifetime is a very challenging research issue. Many clustering algorithms have been proposed recently for wireless sensor networks (WSNs). The use of mobile sinks has been shown to be an effective technique to enhance network performance features such as latency, energy efficiency, network lifetime, etc. In this paper, a modified Stable Election Protocol (SEP), which employs a mobile sink, has been proposed for WSNs with non-uniform node distribution. The decision of selecting cluster heads by the sink is based on the minimization of the associated additional energy and residual energy at each node. Besides, the cluster head selects the shortest path to reach the sink between the direct approach and the indirect approach with the use of the nearest cluster head. Simulation results demonstrate that our algorithm has better performance than traditional routing algorithms, such as LEACH and SEP.

Lifetime enhanced energy efficient wireless sensor networks using renewable energy

In this paper, we consider a remote environment with randomly deployed sensor nodes, with an initial energy of E0 (J) and a solar panel. A hierarchical clustering technique is implemented. At each round, the normal nodes send the sensed data to the nearest cluster head (CH) which is chosen on the probability value. Data after aggregation at CHs is sent to the base station (BS). CH requires more energy than normal nodes. Here, we energize only CHs if their energy is less than 5% of its initial value with the use of solar energy. We evaluate parameters like energy consumption, the lifetime of the network, and data packets sent to CH and BS. The obtained results are compared with existing techniques. The proposed protocol provides better energy efficiency and network lifetime. The results show increased stability with delayed death of the first node. The network lifetime of the proposed protocol is compared to the multi-level hybrid energy efficient distributed (MLHEED) technique and low-energy adaptive clustering hierarchy (LEACH) variants. Network lifetime is enhanced by 13.35%. Energy consumption is reduced with respect to MLHEED-4, 5, and 6 by 7.15%, 12.10%, and 14.975% respectively. The no. of packets transferred to the BS is greater than the MLHEED protocol by 39.03%.

Research on Hierarchical Clustering LEACH Protocol Optimization Algorithm Based on Chebyshev Distance

For the problems of premature death of cluster head nodes, short network life cycle and fast energy consumption in hierarchical clustering LEACH protocol in wireless sensor networks, an improved routing protocol K-means LEACH distance optimization algorithm based on LEACH is proposed in this paper. The improved routing algorithm takes into account the problems such as random selection of cluster heads and tedious calculation of distance formula in LEACH algorithm, so K-means clustering algorithm is introduced. The specific scheme is to first divide the data into K classes, then select the appropriate cluster heads, and introduce the Chebyshev distance formula on the basis of K-means clustering algorithm. From the comparative analysis of the simulation results, the K-means LEACH distance optimization algorithm compared to the original LEACH algorithm wireless network node life cycle by 64%, node energy consumption by 26%, which is conducive to improving the stability of WSN, reducing node energy consumption and extending the network survival time.

Enhancing Heterogeneous Wireless Sensor Networks Using Swarm Intelligence –Based Routing Protocols

The design of efficient communication protocols for wireless sensor networks has aroused great interest in the research community, especially in the face of the limited energy of sensor nodes and the frequent change in network topology. Routing remains a challenging problem in wireless communications, as deploying or replacing sensor nodes in hazardous environments is difficult. Many studies have been devoted to alleviate certain limitations, such as clustering to maintain network connectivity, injecting heterogeneity to avoid the rapid death of nodes, or incorporating evolution-based optimization methods to find the best network configuration. This work combined heterogeneity and swarm-based optimization to efficiently balance energy consumption between nodes to increase network reliability. Specifically, this work employed the binary particle swarm optimizer and the binary artificial bees colony optimizer to find approximately the optimal set of cluster heads (CHs) with their optimal number. Based on the probabilistic principle of the heterogeneous protocols: SEP, EDEEC, and BEENISH, a new refined formulation of CHs selection using swarm optimization is proposed. The swarm flight is guided towards the best CHs with an objective function representing a good balance between the initial and residual energy of nodes. Compared to the standard heterogeneous protocols SEP, EDEEC, and BEENISH, the developed protocols significantly perform better in terms of stability (FND), the round of half nodes' death (HND), the network lifetime (LND), and energy saving. Indeed, the BABC-SEP was found 31,66% better than SEP in terms of remaining energy percentage, and CHs selection in EDEEC and BEENISH using BABC improved them by more than 20% in the percentage of remaining energy.