Frontiers | LEACH Protocol Optimization Based on Weighting Strategy and the Improved Ant Colony Algorithm (2024)

Introduction

It is known that wireless sensor networks (WSNs) are composed of many spatially distributed sensor nodes with limited energy (Efe et al., 2013), whereas the sensor nodes are usually powered by light batteries. Frequent charging or battery replacement of the sensor nodes would cause inconvenience to maintenance; hence, balancing the energy consumption of sensor nodes and prolonging the network lifetime are the two most important indicators to evaluate the performance of the WSNs (Tripathi et al., 2013; Mukherjee et al., 2018). The energy loss of the network can directly affect the performance and life of the network, which should be delicately dealt with to keep the low energy loss of the network in the communication process (Yan et al., 2018; Mohar et al., 2020; Lv et al., 2021). Many routing protocols can be used in WSNs, where hierarchical routing protocols are the most widely adopted. The typical hierarchical routing protocols include low-energy adaptive clustering hierarchy (LEACH), power-efficient gathering in sensor information systems (PEGASIS), threshold-sensitive energy-efficient sensor network (TEEN) protocol, and hybrid energy-efficient distributed (HEED) clustering approach, which can gather the nodes into clusters to form a specific hierarchy (Galkin, 2018). Particularly, the typical LEACH protocol was proposed by Heinzelman (2000) and adopted the “wheel” cycle mode for the first time, which is widely applied due to its low power consumption, node equality, and self-clustering adaptation. In such a protocol, each sensor node contains a clustering algorithm and a data transmission algorithm among nodes (Chen et al., 2015), where the clustering algorithm can randomly change the cluster head nodes by comparing the size of the random number and threshold. After deployment, all sensor nodes self-organize to form different clusters. Generally, each cluster contains a cluster head node and multiple sensor member nodes. The nodes of the specific cluster can only hop one step inside the cluster to the cluster head. The cluster head node of each cluster will also hop one step to transmit the received information to the sink node to complete an iteration circle. The structure of the LEACH protocol is illustrated in Figure 1.

FIGURE 1

Figure 1. Network structure diagram of LEACH protocol.

In the LEACH protocol, the energy of the sensor nodes is evenly distributed, and the network duration can be prolonged by balancing the energy consumption of the sensor nodes (Wang et al., 2018). However, the random selection of the cluster head nodes in the protocol could lead to uneven distribution of the cluster head nodes, which is prone to a large or small number of member nodes in the cluster (Marappan and Rodrigues, 2016). Each cluster head node and the base station adopt a single-hop transmission mode, which could easily cause premature death of the remote cluster head, poor expansibility, and uneven energy consumption phenomena in the network. The replacement mechanism of clusters using wheels will speed up the replacement frequency of the cluster head, which could result in more times of the information transmission in the network and shortened network life (Rahman et al., 2013; Jameii and Maadani, 2016). Then, the LEACH protocol has been improved with the fractional lion (FLION) algorithm to generate the optimal route (Sirdeshpande and Udupi, 2017), whereas the fractional derivative is introduced to detect the neighbor solution, and the forward link algorithm is also used to select channels to improve the network survival duration. However, the distribution density of the nodes is not considered in the fitness function. Lalwani et al. (2018) used the harmony search algorithm (HSA) to determine the optimal routing, where the fitness function is designed considering the node density, energy, and distance factor, by choosing the smallest distance nodes for data transmission so as to achieve the energy consumption reduction of the nodes. However, when the cluster contains non-local nodes, the network performance will be affected. Ning et al. (2017), Ezhilarasi (2019) adopted an improved particle swarm optimization (PSO) to optimize the clusters of the WSN process. However, the selection rules of the cluster head node are relatively complex, and the cluster scale rapid update frequency consumes high energy due to fast convergence. At the same time, local optimum would easily occur. Hence, certain algorithms are proposed to tackle such problems, where the cuckoo search algorithm (CSA) (Huang and Hua, 2020) and the fruit fly algorithm (FFA) (Dai et al., 2020) are developed to optimize the cluster and routing protocol and to determine the transmission path according to the distance, energy, and trust value from the node to the base station such factors. However, the generalization capability of the surviving nodes during communication has not been considered (Maheshwari et al., 2021).

In recent years, some improved heuristic intelligent algorithms have become research hotspots. For instance, the ant colony optimization (ACO) algorithm has been extensively studied and applied since it can assist to select the optimal path for the fused data transmission and the network life cycle extension (Ding, 2020). Experts and scholars have explored the ACO algorithms to reduce the energy consumption of the nodes. An ACO multipath routing protocol has been proposed based on the angle factor and entropy to optimize the cluster head nodes with high reliability in the process of data transmission (Hou et al., 2017; Liu and Li, 2018). To tackle the energy consumption balance problem, Zou and Qian (2019) proposed improved ACO (IACO) with a sensor node transfer function and pheromone updating routing rules for optimal WSN routing but with little consideration of the impact factors. Nayyar and Singh (2020) proposed an energy-saving multipath routing protocol based on the ACO algorithm for dynamic WSNs, in which the optimal path for the adjacent nodes is designed, but the scalability is poor. Therefore, it is of great significance to investigate the method to improve the transmission performance of the WSNs and select the optimal data transmission path quickly and effectively.

This article aims to propose an IACO algorithm for the LEACH protocol optimization. The specific sections are as follows: the first section is the improvement of the clustering algorithm based on optimal combination weighting. Furthermore, the designed transmission path between clusters based on the IACO algorithm is proposed in section Improved Clustering Algorithm Based on OCW. Simulation experiments for the proposed LEACH protocol optimization verification are described in section Energy Consumption Analysis of the Sensor Node. The Conclusion is given in section Optimization of the Transmission Path Between Clusters Based on IACO. Table 1 compares the energy-saving, cluster establishment time, uniform distribution of cluster head nodes, and path selection of the representative typical routing protocols.

TABLE 1

Table 1. WSNs cluster routing protocol performance comparison.

Improved Clustering Algorithm Based on OCW

The Update Mechanism of the Cluster Head Node

In the LEACH, cluster head nodes are replaced at each round, which would increase the network power consumption. Therefore, the cluster head nodes are updated within the existed clusters for the whole network clusters. The node whose energy is lower than the average energy E_a in the cluster loses the qualification to be the cluster head node, whereas the node with the highest remaining energy in the cluster is defined as the cluster head node of the next round, and the average energy E_a in the cluster is defined as,

$\begin{array}{l} E_{a} = \sum \frac{E_{i}}{N_{a l i v e}} & (1) \end{array}$

where E_i is the remaining energy of the surviving node i in the cluster and N_alive is the total number of the surviving nodes. If the energy of the current cluster head nodes is lower than this value, WSNs update the cluster size.

The average energy E_all of all the cluster head nodes in the whole network is calculated as,

$\begin{array}{l} E_{a l l} = \sum \frac{E_{r}}{B} & (2) \end{array}$

where E_r and B are the residual energy and the total number of the cluster head nodes.

The Threshold of the Cluster Head Node Selection

Improved Threshold for Cluster Head Node Selection

The improved LEACH protocol has the same rules as cluster head selection in LEACH protocol, while the selection threshold is defined as T_imp(n), written as,

$\begin{array}{l} T_{i m p} (n) = {\begin{matrix} ω_{1} \frac{E_{i}}{E_{0}} + ω_{2} \frac{E_{a l i v e}}{N_{a l i v e}} + ω_{3} \frac{d_{\max} - d_{i s}}{d_{\max} - d_{\min}}, n \in G \\ 0, n \notin G \end{matrix} & (3) \end{array}$

$\begin{array}{l} R = \sqrt{\frac{S}{π N p}} \\ l_{a l i v e} = {S_{j} | d_{i j} \leq R, S_{j} \in S} \end{array}$

where E₀ is the initial energy of the survived node, l_alive is the number of the existing neighboring nodes, d_max is the distance from node i to the sink node, d_max and d_min are the farthest and closest distance from the surviving node to the sink node, respectively, and {ω₁, ω₂, ω₃} are the weights of the node energy consumption, density, and distance, respectively.

In the improved threshold, the probability of being selected as the cluster head node is related to the energy, density, and distance from the sink node. As the remaining energy of the node decreases and the smaller the energy ratio is, the lower the probability of the node being selected as the cluster head node. If node i is the closest to the sink node, the distance factor is 1, otherwise, the distance factor is 0. Therefore, the range of the distance factor is between 0 and 1, and the closer the distance to the sink node, the closer the value to be 1.

Threshold Weight Selection

To ensure the rationality for the cluster head nodes selection, the optimal combined weighting (OCW) is used to adjust the three weights of the improved threshold, which combines the analytic hierarchy process (AHP) and the entropy method to ensure the objectivity of the threshold weight.

Weight of AHP

The AHP method can decompose the problems into different levels with an evaluation index matrix to solve the maximum eigenvalues of the matrix and the corresponding eigenvector, so as to conduct a consistency test to obtain the weight of different evaluation indices (Yang et al., 2017). However, if the AHP method is used alone, the weight cannot be reasonable due to the large subjective component and certain persuasiveness. Still, the AHP method can be applied to determine the threshold weight in WSNs, and the steps are described as follows:

(1) Construction of the structural model of the cluster head node selection. The hierarchical model of the threshold weight in Region 1 (d_i ≤ d₀) and Region 2 (d_i > d₀) are depicted in Figures 2A,B.

(2) Determination of the evaluation index matrix. The residual energy, distribution density, and distance of the nodes are taken as evaluation indices, which are composed of the evaluation index matrix C, written as,

$\begin{array}{l} C = [\begin{matrix} 1 & c_{12} & c_{13} \\ c_{21} & 1 & c_{23} \\ c_{31} & c_{32} & 1 \end{matrix}] & (4) \end{array}$

where c_ij is the measurement value of the evaluation index, and $c_{j i} = \frac{1}{c_{i j}}$ . The value of the c_ij usually adopts Santy's 1–9 scale method as listed in Table 2.

According to the importance of the impact factors in different regions, evaluation index matrices corresponding to influencing factors can be obtained from different hierarchical models, as shown in Eq. (5).

$\begin{array}{l} C = [\begin{matrix} 1 2 5 \\ \frac{1}{2} 1 3 \\ \frac{1}{5} \frac{1}{3} 1 \end{matrix}] & (5) \end{array}$

(3) The calculation of the AHP weight. According to Eq. (6), the maximum eigenvalue and eigenvector of the evaluation index matrix can be obtained, λ_max and W, respectively, where the corresponding eigenvector is $W = {[W_{1} W_{2} W_{3}]}^{T}$ , and the obtained normalized weight is written in Eq. (7). The eigenvalue of Eq. (5) is 3.0037, and the weight of the energy, density, and distance are 0.581, 0.309, and 0.109 respectively.

$\begin{array}{l} C W = λ_{max} & (6) \end{array}$

$\begin{array}{l} ω_{A i} = \frac{W_{i}}{\sum_{j}^{3} W_{j}} (i = 1, 2, 3) & (7) \end{array}$

(4) Consistency test. When the weights of the different impact factors are obtained, the final consistency test can be carried out to ensure the effectiveness of the obtained weights. The test expressions are expressed in Eqs. (8), (9), and (10). The consistency index of the weight values of the tested regions 1 and 2 is 0.0018, and the consistency ratio is 0.0032.

$\begin{array}{l} C R = \frac{C I}{R I} & (8) \end{array}$

$\begin{array}{l} C I = \frac{λ_{max}}{n - 1} & (9) \end{array}$

$\begin{array}{l} R I = \frac{λ_{\max}}{n - 1} & (10) \end{array}$

where, RI is the average consistency indicator, and CR is the consistency ratio. If C meets the consistency test, CR < 0.1. CI is a consistency indicator and CI = 0 with a high degree of consistency C.

FIGURE 2

Figure 2. Hierarchical model of threshold weight.

TABLE 2

Table 2. Evaluation index matrix value measurement table.

Weight of Entropy Method

The entropy method is an objective weighting method without considering the correlation among factors. Here, the entropy method is applied to determine the threshold weight in WSNs.

Assuming WSNs containing n (n = 1,2,…, N) sensor nodes, the impact factor of the nth node is f_nt t (t = 1,2,…, T), to affect the threshold of the cluster head node selection.

(1) Analysis of the impact factors. According to Eq. (11), the impact factors are determined as the energy f_n1, distance f_n2, and relative density f_n3 of the nth nodes,

$\begin{array}{l} f_{n 1} = \frac{E_{i}}{E_{0}} & (11) \end{array}$

$\begin{array}{l} f_{n 2} = \frac{{d i s}_{max}}{{d m i n}_{max}} & (12) \end{array}$

$\begin{array}{l} f_{n 3} = \frac{l_{a l i v e}}{N_{a l i v e}} & (13) \end{array}$

(2) The entropy method for the weight of impact factors determination.

(a) The above three impact indicators are normalized as,

$\begin{array}{l} F_{n t}^{'} = \frac{f_{n t} - \min (f_{n t})}{\max (f_{n t}) - \min (f_{n t})} & (14) \end{array}$

where max(f_nt) and min(f_nt) are the maximum and minimum of the impact factors, respectively. The evaluation matrix R of the normalized impact factor is obtained as,

Optimal Combined Weighting

The OCW is a method where both the quantitative and qualitative analyses are used to reasonably allocate the weight, and how to allocate the weight of the AHP and entropy is the key of this method (Yang et al., 2017). The weight calculation of the OCW method can be expressed as,

$\begin{array}{l} ω_{t} = λ_{1} ω_{A i} + λ_{2} ω_{S t} & (19) \end{array}$

where ω_t, ω_Ai, and ω_St are the weights of the optimal combination, AHP, and entropy method, respectively. λ₁ and λ₂ are the importance degrees of the AHP and entropy methods, respectively.

A Bunch of Rules

Once the cluster head nodes are determined, they are broadcast inside the WSNs so that the rest sensor nodes are invited to join specific clusters. If a sensor node receives multiple invitation messages within a period of time, it will determine the distance between the cluster head nodes and itself according to the strength of the received information, then make the decision to join the closer cluster and transmit the requested information to the specific cluster head node. The cluster head node receives the distributed information from each member node and decides which nodes can be joined. Then, the clusters can be established, and it enters the data transmission stage.

Energy Consumption Analysis of the Sensor Node

The differences in energy consumption with different routing protocols can be used to evaluate the transceiver characteristics of the sensor nodes. Hence, a typical radio energy consumption model is usually adopted, including the energy consumption of the data transmitting circuit and the power amplifier circuit (Yang et al., 2017), as demonstrated in Figure 3.

FIGURE 3

Figure 3. Wireless communication model of sensor nodes.

There are mainly two energy consumption models for the WSNs, i.e., free-space models and multipath fading models, the adoption of which depends on the distance between the sender and the receiver (Li et al., 2020) and written as,

$\begin{array}{l} E_{T X} (l, d) = E_{T X - e l e c} (l) + E_{T X - a m p} (l, d) \\ = {\begin{cases} - l^{*} E_{e l e c} + l^{*} ε_{f s} * d^{2}, i f d \leq d_{0} \\ - l^{*} E_{e l e c} + l^{*} ε_{m p} * d^{4}, i f d > d_{0} \end{cases} & (20) \end{array}$

where E_TX−elec(l) is the loss of the transmitting circuit energy, E_TX−amp(l, d) is the loss of the amplification circuit energy, and E_elec is the energy loss of the sender/receiver when performing data transmission. The calculation of the threshold of the data transmission distance is written as,

$\begin{array}{l} d_{0} = \sqrt{\frac{ε_{f s}}{ε_{m p}}} & (21) \end{array}$

where ε_fs and ε_mp represent the amplification energy consumption parameters of the free-space model and the multipath fading model, respectively. The type of the transmitter amplifier determines the values of the two parameters.

Optimization of the Transmission Path Between Clusters Based on IACO

Flow Pattern Division

According to the energy consumption model, the energy consumption of the nodes takes the distance threshold d₀ as the intermediate value, so the regions can be divided by the data transmission distance threshold d₀ in the LEACH protocol optimization. The range (d_min ≤ d_i ≤ d₀) within the distance from the sink node d₀ is area 1, and the range within the range of WSN nodes (d₀ ≤ d_i ≤ d_max) is area 2. The partitioning diagram is illustrated in Figure 4.

FIGURE 4

Figure 4. Schematic diagram of the zoning of wireless sensor network deployment node range.

In WSNs, the node positions are usually fixed after deployment. When d_i ≤ d₀, the distance between nodes will not be regarded as the main impact factor, so the weight in the threshold will change. In contrast, when d₀ ≤ d_i, the energy consumption of the node transmission and the distance between nodes increase to the fourth power. Hence, distance is the main impact factor. The weight in Eq. (19) will change with the importance of the impact factor.

Transmission Path Optimization Among Clusters Based on the IACO Algorithm

The ACO algorithm is a heuristic optimization method, which can be used to search the optimal path through individual efforts and group cooperation via accumulated pheromones on the path with positive feedback (Song and Yao, 2017; Li et al., 2020). In WSNs, the optimization of the transmission data path of the routing protocol has the same characteristics as the ACO algorithm to obtain the best foraging route for ants. The application of the ACO algorithm in WSNs still has some limitations, including low path efficiency and the appearance of local optimal solution. Here, the developed IACO algorithm is applied to WSNs to conduct path optimization from three aspects, improved transition probability, path superiority, and pheromone updating mechanism.

Transfer Probability Improvement

The transition probability of the ACO algorithm considers only the path pheromone concentration and the distance between two nodes. The ant in the process of the optimal path search can also increase the probability of invalid path search and reduce the efficiency of path construction. Because the impact factors are not comprehensive, the flow of the data transmission of the nodes is larger, which could result in premature death affecting the network operation.

By using the ACO algorithm in WSN, the distance between two nodes is only considered in the next hop of the cluster node selection, which could cause more candidate nodes and a large amount of data transmission accompanied by more energy consumption. In this article, the transition probability is fully considered with the node energy for the ants' node search ability enhancement, so as to speed up the convergence speed, and the developed transition probability function is formatted as,

$\begin{array}{l} P_{i j}^{k} (t) = {\begin{matrix} \frac{{(τ_{i j})}^{α} {(η_{i j})}^{β} {(E_{j a})}^{γ}}{\sum_{s \in a l l o w e d_{k}} {(τ_{i s})}^{α} {(η_{j s})}^{β} {(E_{j a})}^{γ}}, s \in a l l o w e d_{k} \\ 0, s \in a l l o w e d_{k} \end{matrix} & (22) \end{array}$

$\begin{array}{l} E_{j a} = \frac{E_{j}}{E_{i a v e}} & (23) \end{array}$

where allowed_k is the cluster head node set where k nodes have not been reached, E_j is the remaining energy of the next hop node, and E_iave is the average energy of the adjacent nodes of node i. τ_ij is the pheromone concentration of the path from node i to node j, and η_ij is the heuristic function to be defined for the cluster head node

Based on the forwarding distance j node and the distance of the aggregation node, written as,

$\begin{array}{l} η_{i j} = \frac{1}{d_{i j} + d_{j s}} & (24) \end{array}$

where d_ij is the Euclidean distance between node i and the next hop node j, and d_js is the Euclidean distance between the next hop node j and the sink node.

Path Superiority Determination

When all ants are transferred to the sink node, each ant corresponds to a transmission path, so the path superiority degree can be used as the standard to measure the optimal path. The ant with a higher superiority degree is the optimal transmission path. In the previous path optimization process, the path with higher average energy is highly likely to be the best transmission path; however, the mean energy cannot represent the current node energy level. For instance, if certain nodes have high energy mean, but the energy difference between the actual nodes is substantially large, it will cause premature death of the nodes and failure of the transmission path. The path superiority is thus reflected from the lower hop count, higher mean energy, and uniform energy distribution. The higher the path superiority, the higher quality of the selected transmission path.

The variation coefficient is defined by the ratio between the SD and mean of the data, which is used to evaluate the difference degree of the data distribution. The smaller the coefficient of the variation, the more uniform the data distribution, and the smaller difference between the data (Zhu, 2017). Therefore, the path variation coefficient P_cv is used to analyze the energy balance of the nodes.

$\begin{array}{l} P_{c v} = \frac{P_{s d}}{P_{m}} = \frac{\sqrt{\frac{1}{δ} \sum_{i = 1}^{δ} {(E (i) - E_{a v e})}^{2}}}{E_{a v e}} & (25) \end{array}$

where P_sd is the SD of the energy of all nodes in the path P_m, E_ave is the mean energy of all nodes in the path, and δ is the number of nodes contained in the path.

Hence, the path superiority P_s can be written as,

$\begin{array}{l} P_{s} = \frac{E_{min}}{E_{c o n} \frac{1}{P_{c v}} + \frac{1}{J}} & (26) \end{array}$

where E_min is the minimum of the node energy, E_con is the sum of the node energy consumption, and J is the total hop number in the path.

Pheromone Updating

In the ACO algorithm, the pheromone concentration varies according to the length of the path, and ants plan the next route according to the pheromone concentration of different paths. Ants tend to choose paths with higher pheromone concentrations, and other paths are ignored. As a result, the path searching will fall into the local optimization, the ant will no longer search for new paths and the path searching process stops. Therefore, the IACO algorithm adds local and global pheromone updates to inter-cluster transmission path planning to avoid such local optimum problems. The developed pheromone updating mechanism is written as,

$\begin{array}{l} τ_{i j} (t + 1) = (1 - ρ) τ_{i j} (t) + ρ Δ τ_{i j} (t) & (27) \end{array}$

$\begin{array}{l} Δ τ_{i j} (t) = \sum_{k = 1}^{N} Δ τ_{i j}^{k} (t) & (28) \end{array}$

where ρ is the parameter regulating the pheromone volatilization speed, Δτ_ij(t) is the pheromone increment in the path, Δτ_ij(0) = 0 at the initial time, and $Δ τ_{i j}^{k} (t)$ is the pheromone concentration left by the kth ant in the path (i, j).

• Local pheromone update: If the ant node carries out data forwarding from the cluster head node i → j, the pheromone concentrations of the corresponding paths should be locally updated,

$\begin{array}{l} Δ τ_{i j}^{k} (t) = \frac{E_{r} (j)}{d (i, j)} & (29) \end{array}$

where E_r(j) is the number of the member nodes in the next hop node.

• Global pheromone update: When all ants move to the sink node, each ant corresponds to a transmission path, and the pheromone concentration of the path is updated globally. Based on the path superiority, the global update rules is written as,

$\begin{array}{l} Δ τ_{i j}^{k} (t) = \frac{1}{P_{s}} & (30) \end{array}$

The LEACH protocol is optimized with the improved clustering algorithm to cluster sensor nodes, and the influence factors of nodes in different network regions are different so as to replace the cluster head nodes dynamically. When the energy of the cluster head node reaches the limit value, the cluster is updated and the data are fused in the cluster head node. Although the IACO algorithm is used to find the optimal transmission path between clusters, it can effectively avoid the stagnation of the IACO algorithm in the local optimum. The specific process is depicted in Figure 5.

FIGURE 5

Experimental Verification and Analysis

Experimental Environment Setting

The experiment verification is carried out in a MATLAB simulation environment, and 200 sensor nodes are deployed in a 200 × 200 m network area. The node deployment within the network is shown in Figure 6, where the circle with sink node is the center, the area with the threshold distance R as the radius of the circle is area 1, and the rest is area 2. The parameters of the basic network and IACO algorithm in the experiments are listed in Tables 3, 4.

FIGURE 6

Figure 6. Sensor node deployment diagram.

TABLE 3

Table 3. Basic parameter settings of the network.

TABLE 4

Table 4. Basic parameter setting of IACO algorithm.

Performance Indicators

The life cycle of the network, the total energy consumption of the network, and the data received by the sink node are taken as indicators to evaluate the quality of the routing protocol. The specific analysis is as follows:

1. Network life cycle: the duration from the normal operation of the WSN after the successful layout to the death of the last node. Three indicators were selected for evaluation, namely, the number of rounds in which the first node died (indicator 1), the number of rounds in which 10% of nodes died (indicator 2), and the number of rounds in which all nodes died (indicator 3). In most cases, the appearance of the dead nodes leads to the deterioration of the network detection quality, so the number of rounds where the first node dies is of particular importance.

2. Total network energy consumption: the total energy consumption of all nodes in the network during implementation. This index can reflect the balance degree of energy consumption. In the simulation, the size of the packet and control packet is set, and the energy consumptions of different nodes are calculated through the network operation.

3. Data received by the sink node: data received by the sink node after each round of the network operation.

Experimental Results and Analysis

The simulation results of different routing protocols are analyzed based on the above performance indicators to verify the effectiveness of the ILEACH protocol.

Figures 7, 8 compare the number of surviving nodes and total network energy consumption of the LEACH protocol and the ILEACH protocol, respectively. To be specific, the impact of the ILEACH protocol on the network life cycle is analyzed via indicators 1 and 2, as shown in Figure 8.

FIGURE 7

Figure 7. Comparison curve of the number of surviving nodes in the network.

FIGURE 8

Figure 8. Comparison curve of total network energy consumption.

Figure 9 indicates that indicator 1 of the LEACH protocol and the ILEACH protocol appears in rounds 141 and 199, respectively, and indicator 2 appears when the network operates to rounds 596 and 986. When the LEACH protocol reaches ~600 rounds, most nodes have no power, but the ILEACH protocol can be extended to ~1,200 rounds. The network needs to be initialized in the early stage, which consumes energy quickly, and there are fewer surviving nodes in the later stage. However, ILEACH can effectively balance the energy consumption of nodes by considering the energy consumption of nodes in the process of clustering and data transmission, and the network energy consumption varies slowly in the later period. It is proven that the improved threshold and the replacement mechanism of the cluster head nodes can reduce the energy consumption of the nodes, and the ILEACH protocol can prolong the network life cycle much longer compared with the LEACH protocol.

FIGURE 9

Figure 9. Indicator analysis histogram.

Figures 10, 11 compare the number of the surviving nodes and total network energy consumption between the LEACH of ACO (ACO-LEACH) protocol and the LEACH of IACO (IACO-LEACH) protocol, where Figure 11 is the histogram of the index. Figure 12 illustrates that indicator 1 of the ACO-LEACH protocol and IACO-LEACH protocol occurs in rounds 199 and 329, respectively, and indicator 2 occurs in rounds 986 and 2,338. Table 5 displays the number of the first node deaths, 10% node deaths, and all node deaths under different protocols. In conclusion, the developed IACO algorithm can gradually find the optimal transmission path for the WSN operation and save energy in the data transmission stage effectively.

FIGURE 10

Figure 10. Comparison curve of the number of surviving nodes in the network.

FIGURE 11

Figure 11. Comparison curve of totalnetwork energy consumption.

FIGURE 12

Figure 12. Indicator analysis histogram.

TABLE 5

Table 5. Comparison table of the network life cycle of different protocols.

Conclusion

An algorithm based on OCW and IACO is proposed in the article to solve the problem of high energy consumption of the traditional LEACH protocol in WSNs. The ILEACH protocol adopts the cluster head node replacement mechanism to reduce the energy consumption considering the energy, density, and nodes distance for the threshold selection, which can effectively avoid the randomness of the clustering. Furthermore, the OCW is used to dynamically change the weight of the nodes according to the different impact factors of nodes in different regions. The developed IACO algorithm can optimize the transfer probability of the sensor nodes with the local update and global update strategies, which can prolong the life cycle of the network to a certain extent. The network environment is deployed through MATLAB simulation software to verify the feasibility of the ILEACH protocol.

Data Availability Statement

The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author.

Author Contributions

XC and JZ proposed the idea in this study. CX and XL designed the experiment, performed the simulation experiments, analyzed the experiment results, and wrote the manuscript. JL corrected the manuscript. All authors contributed to the article and approved the submitted version.

Funding

The project (work) was supported by the National Natural Science Foundation of China Program (No. 62073198) and the Major Research Development Program of Shandong province of China (No. 2016GSF117009).

Conflict of Interest

XL is employed by Shandong Senter Electronic Co., Ltd.

The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Publisher's Note

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.

Acknowledgments

We acknowledge the support of the College of Electrical Engineering and Automation and the College of Energy and Mining Engineering in Shandong University of Science and Technology and Shandong Senter Electronic Co., Ltd.

References

Chen, S. X., He, Z. S., Xiong, H. L., and Liao, J. W. (2015). A wireless sensor signal reconstruction algorithm based on compressed sensing. Journal of computer science, Papers 38, 614–624. doi: 10.3724/SP.J.1016.2015.00614

CrossRef Full Text | Google Scholar

Dai, J. Y., Deng, X. H., Wang, B., and Wang, H. H. (2020). Clustering routing protocol for wireless sensor networks based on improved firefly optimized neural network. Journal of Beijing University of Posts and telecommunications, Papers 43, 131–137. doi: 10.13190/j.jbupt.2019-161

CrossRef Full Text | Google Scholar

Ding, H. (2020). Data fusion algorithm for wireless sensor networks based on ant colony optimization. Journal of Shenyang University of technology, Papers 42, 208–212. doi: 10.7688/j.issn.1000-1646.2020.02.16

PubMed Abstract | CrossRef Full Text | Google Scholar

Efe, K., Ibrahim, K., and Cevdet, A. (2013). Active node determination for correlated data gathering in wireless sensor networks. Computer Networks 57, 1124–1138. doi: 10.1016/j.comnet.2012.11.018

CrossRef Full Text | Google Scholar

Ezhilarasi, M., and Krishnaveni, V. (2019). An evolutionary multipath energy-efficient routing protocol (emeer) for network lifetime enhancement in wireless sensor networks. Soft Computing A Fusion of Foundations Methodologies and Applications. Papers 23, 8367–8377. doi: 10.1007/s00500-019-03928-1

CrossRef Full Text | Google Scholar

Galkin, P. (2018). Model of Reducing the Power Consumption for Node of Wireless Sensor Network in Embedded Control Systems. 2018 International Scientific-Practical Conference Problems of Infocommunications. Science and Technology (PIC SandT), pp. 252-256. doi: 10.1109/INFOCOMMST.2018.8631891

PubMed Abstract | CrossRef Full Text | Google Scholar

Heinzelman, W. R. (2000). Energy-efficient communication protocol for wireless microsensor networks. Proc. IEEE Annu. Hawaii Int. Conf. Syst. Sci. 8:8020.

Google Scholar

Hou, M. T., Zhao, Z. P., Gao, M., and Zhang, N. N. (2017). Ant colony optimization multipath routing algorithm adopted angle factor. Computer Engineering and Applications. Papers 53, 107–112. doi: 10.3778/j.issn.1002-8331.1604-0176

CrossRef Full Text | Google Scholar

Huang, Y., and Hua, Y. Q. (2020). Routing optimization of wireless sensor networks with energy and path constraints. Journal of Xi'an University of Electronic Science and technology, Papers 47, 113–120. doi: 10.19665/j.issn1001-2400.2020.03.016

PubMed Abstract | CrossRef Full Text | Google Scholar

Jameii, S. M., and Maadani, M. (2016). Intelligent dynamic Connectivity Control Algorithm for cluster-based wireless sensor networks. 2016 11th International Conference for Internet Technology and Secured Transactions (ICITST), pp. 416-420, doi: 10.1109/ICITST.2016.7856744

CrossRef Full Text | Google Scholar

Lalwani, P., Das, S., Banka, H., and Kumar, C. (2018). Crhs: clustering and routing in wireless sensor networks using harmony search algorithm. Neural Computing and Applications 30, 1–21. doi: 10.1007/s00521-016-2662-4

CrossRef Full Text | Google Scholar

Li, X. Q., Ma, R., Zhang, S., Hou, Y. Z., and Pei, Y. F. (2020). Improved design of Ant Colony Optimization and its application in Track Planning. Journal of Aeronautics, Papers 41, 213–219. doi: 10.7527/S1000-6893.2020.24381

CrossRef Full Text | Google Scholar

Liu, H., and Li, H. W. (2018). Non uniform clustering routing algorithm based on Ant Colony Optimization,” Journal of Huazhong University of science and Technology (Natural Science Edition), Papers 46(08), 50–54. doi: 10.13245/j.hust.180810

CrossRef Full Text | Google Scholar

Lv, L., Peng, F., Chen, W., and Wang, J. (2021). Node Deployment of Wireless Sensor Networks Based on MOEA/P Algorithm. 2021 13th International Conference on Communication Software and Networks (ICCSN). pp. 173-178. doi: 10.1109/ICCSN52437.2021.9463630

PubMed Abstract | CrossRef Full Text | Google Scholar

Maheshwari, P., Sharma, A. K., and Verma, K. (2021). Energy efficient cluster based routing protocol for wsn using butterfly optimization algorithm and ant colony optimization. Ad Hoc Networks 110, 102317. doi: 10.1016/j.adhoc.2020.102317

CrossRef Full Text | Google Scholar

Marappan, P., and Rodrigues, P. (2016). An energy efficient routing protocol for correlated data using CLLEACH,nd in WSNs. Wireless Networks. 22(04): 1415–1423. doi: 10.1007/s11276-015-1063-4

CrossRef Full Text | Google Scholar

Mohar, S. S., Goyal, S., and Kaur, R. (2020). Optimized sensor nodes deployment in wireless sensor network using bat algorithm. Wireless Personal Communications(2), 1–19. doi: 10.1007/s11277-020-07823-z

CrossRef Full Text | Google Scholar

Mukherjee, M., Lu, Y. R., Matam, R., and Choudhury, N. (2018). Energy trading in sleep scheduling for wireless rechargeable WSNs, 2018 10th International Conference on Communication Systems and Networks (COMSNETS). pp. 429–431. doi: 10.1109/COMSNETS.2018.8328235

CrossRef Full Text | Google Scholar

Nayyar, A., and Singh, R. (2020). Ieemarp- a novel energy efficient multipath routing protocol based on ant colony optimization (aco) for dynamic sensor networks. Multimedia Tools and Applications, Papers 79, 35221–35252. doi: 10.1007/s11042-019-7627-z

CrossRef Full Text | Google Scholar

Ning, W., Yuan, Z., and Jinghao, L. (2017). A hierarchical clustering protocol for wireless sensor Networks based on improved particle swarm Optimization. Chinese Journal of Sensing Technology 30, 120–125. doi: 10.3969/j.issn.1004-1699.2017.01.022

CrossRef Full Text | Google Scholar

Rahman, A. U., Hasbullah, H., and Sama, N. U. (2013). Efficient energy utilization through optimum number of sensor node distribution in engineered corona-based (onsd-ec) wireless sensor network. Wireless Personal Communications 73, 1227–1243. doi: 10.1007/s11277-013-1275-9

CrossRef Full Text | Google Scholar

Sirdeshpande, N., and Udupi, V. (2017). Fractional lion optimization for cluster head-based routing protocol in wireless sensor network. Journal of the Franklin Institute 354, 4457–4480. doi: 10.1016/j.jfranklin.2017.04.005

CrossRef Full Text | Google Scholar

Song, Y., and Yao, X. (2017). Design of Routing Protocol and Node Structure in Wireless Sensor Network Based on Improved Ant Colony Optimization Algorithm. 2017 International Conference on Computer Network, Electronic and Automation (ICCNEA) 2017, pp. 236–240. doi: 10.1109/ICCNEA.2017.54

CrossRef Full Text | Google Scholar

Tripathi, R. K., Singh, Y. N., and Verma, N. K. (2013). Clustering algorithm for non-uniformly distributed nodes in wireless sensor network. Electronics Letters 49, 299–300. doi: 10.1049/el.2012.3512

CrossRef Full Text | Google Scholar

Wang, C., Wang, Z., Zhu, Y., and Han, Z. (2018). The Application of Data-Level Fusion Algorithm Based on Adaptive-Weighted and Support Degree in Intelligent Household Greenhouse. In: Zhu Q., Na J., Wu X. (eds) Innovative Techniques and Applications of Modelling, Identification and Control. Lecture Notes in Electrical Engineering, vol 467. Springer, Singapore. doi: 10.1007/978-981-10-7212-3_6

CrossRef Full Text | Google Scholar

Yan, Z., Goswami, P., Mukherjee, A., Yang, L., Routray, S., and Palai, G. (2018). Low-energy pso-based node positioning in optical wireless sensor networks. Optik - International Journal for Light and Electron Optics. Papers 181, 378–382. doi: 10.1016/j.ijleo.2018.12.055

CrossRef Full Text | Google Scholar

Yang, M., Hu, W., and Wang, Y. S. (2017). Risk assessment of debris flow in the lower reaches of Zagunao River Based on Optimal Combination Weighting and fuzzy comprehensive evaluation method. Journal of natural science of Heilongjiang University, Papers 34, 271–278. doi: 10.13482/j.issn1001-7011.2016.07.230

CrossRef Full Text | Google Scholar

Zhu, Z. C. (2017). Hybrid cross weighting method based on coefficient of variation G1 method. Statistics and decision making, Papers 12, 78–81. doi: 10.13546/j.cnki.tjyjc.2017.12.018

CrossRef Full Text | Google Scholar

Zou, Z. F., and Qian, Y. (2019). Wireless sensor network routing method based on improved ant colony algorithm. J Ambient Intell Human Comput 10, 991–998. doi: 10.1007/s12652-018-0751-1

CrossRef Full Text | Google Scholar