Efficient sensor operation and extended network lifetime are critical for effective water quality monitoring using Wireless Sensor Networks (WSNs). Traditional models often neglect the importance of information value, leading to redundant data transmission from low-value sensors and inefficient energy consumption. This study proposes a novel information-centric algorithm that employs Minimum Redundancy, Maximum Information (MIRI) principles to prioritize data collection from high-information sensors. By dynamically assessing the information value at each round, the algorithm strategically selects Cluster Heads (CHs) based on their ability to provide valuable insights while conserving energy. Simulation results indicate that the proposed model achieves an average residual energy of 65% after 1,500 rounds, compared to only 35% in conventional models. Additionally, the algorithm extends individual sensor lifetimes by up to 40%. These findings highlight the effectiveness of an information-centric approach in optimizing WSN performance, thereby facilitating improved efficiency in environmental monitoring applications.

  • This research presents a novel information-centric algorithm for optimizing energy in water quality monitoring WSNs.

  • The algorithm utilizes minimum redundancy maximum information (MIRI) principles to prioritize high-value data.

  • It enhances network lifetime by reducing redundant data transmission from low-information sensors.

  • Results demonstrate significant performance improvements in energy efficiency and data accuracy through simulations.

Water security is a critical issue that many countries around the world are coping with today (Saputra et al. 2023). The challenges are complex, including inadequate access to safe water, inefficient water management practices, increasing levels of water pollution, and escalating water demand driven by population growth and urbanization (Sukri et al. 2023). Ensuring water security is essential for achieving Sustainable Development Goal 6 (SDG 6), which aims to ensure availability and sustainable management of water and sanitation for all (Javaid et al. 2013). This goal is fundamental to human health, environmental sustainability, and economic prosperity. Addressing water security challenges requires innovative and sustainable solutions that encompass water conservation, infrastructure development, and improved water governance to ensure equitable access to safe and sufficient water resources.

Continuous evaluation and assessment of water quality are crucial for ensuring the safety and health of water resources (Abdolabadi et al. 2016). With the rapid growth of economies leading to increased pollutant discharge and emerging challenges such as the spread of diseases influenced by environmental conditions, there is growing concern over water quality (Magd et al. 2023). To address the concerns, there is an urgent need to ensure the society about the safety and health of water resources (United Nations Department of Economic and Social Affairs 2022). Traditionally, water quality monitoring involves field sampling and laboratory analysis which are not only challenging and time-consuming but also costly and may not provide the real-time data (Adu-Manu et al. 2020). However, contemporary approaches promote advancements in technology to innovate monitoring devices autonomous and capable of in situ measurement (Silva et al. 2022).

Water quality networks (WQNs) provide accurate and real-time information about the condition of water (Dasig 2019). Such information is vital for devising informed strategies regarding water management, pollution control, and safe water supply (Kumari et al. 2020). These networks allow us to detect prompt changes in water quality to avoid any potential hazards (Liu & Wu 2022). WQNs typically involve a network of sensors installed at specific locations within a water system (Saputra et al. 2023). These sensors collect data at consistent time slots and transmit the data to a central system (Pule et al. 2017). The data can then be investigated to assess the physical, chemical, and biological characteristics of water, identify trends, and detect any deviations from established standards or guidelines (Miller et al. 2023). With the advent of new technologies, many researchers and organizations have employed wireless sensor networks (WSNs) and Internet of Things (IoT) to facilitate effective and remote water quality monitoring (Wu et al. 2016; Ahmedi et al. 2018; Saravanan et al. 2018; Gurusamy & Diriba 2022; Ali et al. 2023; de Camargo et al. 2023). WSNs are self-configuring and self-coordinating networks that classically consist of sensor nodes equipped with energy sources, sensing mechanisms, data storage units, and transmitters (Zhao et al. 2018a). WSNs have become an essential tool in many areas, including environmental monitoring, agriculture, and industrial automation (Ullo & Sinha 2020). Several researches employed WSNs to monitor diverse water quality indicators such as pH, temperature, turbidity, total dissolved solids, redox, and dissolved oxygen (Khetre & Hate 2013; Sridharan 2014). For instance, Adu-Manu et al. (2020) employed wireless sensor nodes for real-time water quality monitoring, using energy-efficient data transmission and solar panels for node longevity. Conducted in Ghana's Greater Accra Region, the study used smart water sensors to measure physical and chemical parameters at Weija intake, a vital water source. Results revealed varying levels of pH, conductivity, calcium, temperature, fluoride, and oxygen content, impacting plant and aquatic life.

The widespread implementation of WSNs requires careful consideration of several factors, including energy consumption, scalability, and interruption during data collection to ensure the successful deployment and operation of WSNs for environmental monitoring (Zulkifli et al. 2022). Designing WSNs for environmental monitoring involves crucial considerations: placing sensor nodes for optimal coverage, managing energy efficiency, managing distance to reduce the energy during data transmission, designing communication protocols to accommodate limited bandwidth, employing data aggregation methods, and establishing scalable architectures (Wu et al. 2016; Evangelakos et al. 2022; Gurusamy & Diriba 2022). So far, energy consumption has been known as one of the most critical factors in WSNs design compared with other issues (Gherbi et al. 2017). The sensor nodes' limited energy capacity necessitates the development of energy-efficient protocols and algorithms to minimize power consumption during communication, data processing and aggregation, and data transmission (Rawat & Chauhan 2021). Efficient utilization of energy resources helps prolong the network's lifespan and improves its overall performance. A wide variety of studies assessed how data aggregation and routing algorithms heighten the energy efficiency of the networks (Smaragdakis et al. 2004; Nguyen et al. 2017; Shahraki et al. 2017; Abdulsalam et al. 2018; Rajathi 2023).

Clustering-based models aim to improve energy efficiency in WSNs by reducing the energy consumption of individual sensor nodes. By organizing the network into clusters, energy can be conserved by selecting cluster heads (CHs) that perform data aggregation and communication tasks, while other nodes can operate in a low-power sleep mode (Sharma et al. 2019). One popular clustering algorithm is low-energy adaptive clustering hierarchy (LEACH) (Heinzelman et al. 2000). LEACH utilizes a randomized rotation of CHs to evenly distribute energy consumption among nodes and extend the network lifespan. Various improvements over the original LEACH protocol address issues like non-uniform cluster head distribution and energy consumption. These enhancements include C-LEACH, employing centralized selection of CHs based on energy and location information (Heinzelman et al. 2002); MODLEACH, which optimizes energy usage by replacing CHs only when energy levels surpass a threshold and by employing differentiated signal amplification for various communication types (Mahmood et al. 2013): TL-LEACH (two levels LEACH), which addresses uneven energy distribution through secondary and primary CHs (Zhixiang & Bensheng 2007; Peng et al. 2015); PEGASIS (power efficient gathering sensor information system), using chain structure for energy-efficient data gathering and dissemination (Lindsey & Raghavendra 2002; Arora et al. 2016); DFCA (distributed fault tolerance clustering algorithm) (Azharuddin et al. 2013), which employ gateways and backup nodes for energy-efficient data transmission; and MLRC (multi-level route-aware clustering) employs a route-aware approach to establish communication paths among sensor nodes (Sabet & Naji 2016).

Fuzzy-based approaches aim to optimize CH selection and network performance in WSNs by enhancing the selection of CHs and mitigate uncertainties arising from environmental factors and overlapping parameters (Guo & Zhang 2014). LEACH-FL is an advanced version of LEACH employing fuzzy logic with input variables such as residual energy, distance to the Base Station (BS), and node degree for CH probability calculation (Ran et al. 2010). Multi-objective fuzzy clustering algorithm (MOFCA) addresses hot spot and energy depletion challenges, with nodes selecting temporary CHs based on fuzzy inputs (Sert et al. 2015). An adaptive multi-clustering algorithm using fuzzy logic (MCFL) utilizes three clustering algorithms guided by fuzzy logic and inputs for CH selection, adapting based on CH energy levels and thresholds (Mirzaie & Mazinani 2017). Lastly, a distributed fuzzy logic-based unequal clustering approach and routing algorithm (DFCR) encompasses information sharing, cluster formation, virtual backbone establishment, and data routing, with fuzzy logic-driven decisions for CH competency, timer-based radius calculations, member selection, and virtual backbone classification (Mazumdar & Om 2018).

Metaheuristic approaches are also utilized to address the complexity of clustering with the aim of efficiently selecting CHs from a vast solution space (Al Aghbari et al. 2020; Del-Valle-Soto et al. 2023; Abdolabadi & Khosravian 2025). Given the optimization problems, these methods offer valuable solutions. GP-LEACH and HS-LEACH are examples of how genetic algorithms and harmony search enhance CH selection (Mohammad et al. 2012). Sharmin et al. (2023) utilized the hybrid (HPSO-ILEACH) for CH selection to enhance the efficiency and lifespan of WSNs. Results indicate that the proposed hybrid algorithm boosts the network's lifespan and controls average energy consumption. Diakhate et al. (2023) implemented the firefly algorithm optimization for optimal CH selection. To evaluate the performance, the number of dead nodes and data packets received by the BS are assessed. Results demonstrate the efficacy of the proposed hierarchical clustering approach. Jabbar et al. (2023) introduced a novel routing strategy known as FLH-P, which integrates fuzzy logic with the hybrid energy-efficient distributing (HEED) algorithm to improve both the longevity of the network and the energy levels of individual nodes. The FLH-P approach employs HEED to establish clusters, and subsequently, a combination of fuzzy inference and the LEACH algorithm to take into account factors such as residual energy, minimal hops, and node traffic. Results showed the effectiveness of the FLH-P in reducing energy consumption and prolonging the network's operational lifespan. Bharany et al. (2023) proposed a clustering procedure for underwater wireless sensor networks (UWSNs) using the glowworm swarm optimization algorithm to improve energy efficiency.

Reviewing the literature reveals that while classical, fuzzy-based, metaheuristic, and hybrid approaches take into consideration clustering-based macro and micro parameters, as well as methodology based parameters such as residual energy, distance to the BS, node degree, and the chance of becoming a CH (Fanian & Rafsanjani 2019), there is a lack of attention to the value of information gained by the sensor nodes. As sensors consume energy to collect data from the environment, it is essential to ensure that the data are relevant and provide useful insights for the intended applications. Therefore, information gain plays a crucial role in determining the effectiveness of the network. Studies demonstrate the diverse applications of entropy theory in water systems, ranging from network evaluation and design to understanding the information content and organization of hydrological data (Shi et al. 2018; Chen et al. 2022). The entropy theory measures the amount of information in a random variable or a set of variables (Keum et al. 2017). The application of entropy theory in water systems has gained significant attention in the literature. Ruddell & Kumar (2009) introduced the concept of ecohydrologic process networks and identified the information content and organization of these networks using entropy theory. They discussed the potential of entropy-based measures in understanding the interactions and information flow within ecohydrologic systems. Li et al. (2012) proposed an approach that introduces a criterion called maximum information minimum redundancy (MIMR), based on the entropy theory. MIMR aims to optimize station placement by maximizing joint entropy among selected stations while considering transinformation both within and outside the chosen stations.

In this paper, we aim to introduce a novel information-centric algorithm designed specifically for WSNs deployed in water quality monitoring applications. This approach departs from conventional methods that treat all sensors equally. Our approach prioritizes data from sensors with high information value. By utilizing entropy theory and MIRI principles, the algorithm identifies these crucial sensors and optimizes energy consumption through strategic data collection. This focus on information value ensures the network gathers the most critical data while extending sensor lifetimes and network longevity. This research contributes to the field of WSN optimization by demonstrating the effectiveness of an information-centric approach in improving network performance and efficiency in resource-constrained environments.

The structure of this paper is as follows: Section 2 reviews the basic entropy for monitoring network selection, MIRI principles to identify high information sensors, the network model including the network setup, the clustering protocol, and CH selection algorithms. Section 3 presents a numerical example to demonstrate the proposed model. Section 4 discusses the results obtained from the simulations and highlights the benefits of the information-centric approach. Then, it compares the performance of our proposed algorithm against the existing model. Finally, Section 5 summarizes the key findings and emphasizes the potential of information-centric techniques for enhancing WSN efficiency and longevity.

Basic entropy for monitoring network selection

In the entropy theory, essential information measures encompass marginal entropy, joint entropy, transinformation, and total correlation. These metrics give insights about the amount of information retained by individual random variables, the collective information conveyed by multiple variables, the extent to which knowledge of one variable can infer information about another, and the redundant information shared among multiple variables (Wang et al. 2018).

Let us consider an initial set of monitoring stations, denoted as with n1, n2, …, nn dissolved oxygen (DO) samples (for example, ). The marginal entropy of an individual random variable XStation1 is calculated as follows:
(1)
where n represents the number of possible values of XStation1, and p(XStation1i) is the probability of XStation1 equaling XStation1i. The joint uncertainty of S can be quantified by their multivariate joint entropy:
(2)
where p(XStation1, XStation2, …, XStationN) is the joint probability of all variables. This entropy indicates the overall information retained by all stations. If all variables are independent, the multivariate joint entropy equals the sum of marginal entropies. The shared information transfer between variables is addressed by transinformation (mutual information). The transinformation between XStation1 and XStation2 is calculated as follows:
(3)
Total correlation, C, quantifies the extent of duplicated information among monitoring stations. It differs from mutual entropy, as it specifically measures the shared information among multiple variables.
(4)
Calculating the joint probability is challenging, as the number of variables increases. To address this challenge, the merging approach can be utilized (Chen et al. 2022). In this approach, a variable is merged with another in a manner that results in the entropy of the new variable being equal to the joint entropy of the original pair of variables. Alfonso et al. (2010) proposed an agglomeration method wherein the data records of two variables are merged to form a new variable. Subsequently, a similar procedure is applied to combine the new variable with a third variable, and this process of combining variables and calculating their joint entropy is repeated. This direct method has a limitation that can exhaust the memory, especially with a substantial sample size. In response to this issue, Li et al. (2012) proposed an adapted merging alternative method. A new sample, denoted as X, is created by putting the corresponding digits together from X1 and X2. Next, the unique values from the combined sample X extracted in ascending order, resulting in a ranked sample labeled Xr. Then, the location index of each element in the original sample X within this ranked sample Xr is found and each element is assigned with a new label based on its location index. Based on these methods, multivariate joint entropy, total correlation, and multivariate transinformation, Tm between two grouped variables (for example, a subset of k monitoring stations called Xm and the n (Nk) remaining stations Xw) are computed as follows:
(5)

where ⟨·⟩ is the merging operator.

Now, suppose that there are some candidate monitoring stations within S that have correlated data. A subset can be identified, which satisfies the condition that its entropy, H(M), matches the entropy of the full set S, H(S). Optimization algorithms can be employed to solve this problem. The optimization problem accounts for the selection of stations from S that maximize the total information content and information transfer, and minimize the redundant information. Li et al. (2012) introduced the MIMR criterion as a single-objective function.
(6)

The parameters λ1 and λ2 represent the trade-off weights between information and redundancy in the network design, and they are constrained by the condition λ1 + λ2 = 1. To maximize the information content, λ1 should be assigned a larger value compared with λ2, as suggested in prior studies 0.8 and 0.2, respectively (Li et al. 2012; Wang et al. 2018). In this process, monitoring stations with higher uncertainty information are usually prioritized. Moreover, the selected stations should share as much information as the unselected stations.

Network model

In this section, we illustrate the structure of the network model developed based on the energy balanced model presented by Zhao et al. (2018b). Then, we introduce a new method to determine the CHs which account for the information value of sensor nodes. The network model setup process involves several steps. The first step is to determine the optimal number of clusters (k) which is vital as it helps to ensure that the network is efficient and effective. Once the optimal number of clusters is determined, we cluster the sensor nodes based on the balanced energy consumption model using a hybrid algorithm that combines the K-means and crystal structure algorithm. Then, the entropy method is implemented to gauge the information value attributed to each node. Its primary function is to differentiate the nodes that possess the highest level of significance within the network. This, in turn, allows for determining the nodes that should be given priority to maintain continuous operation and maximize the network lifespan. Using this information, CHs are selected by optimizing distance, residual energy, and the information value associated with each node. Subsequently, a two-fold approach is implemented. Firstly, the division of energy strategy within the large clusters is employed by defining a secondary CH. Then, the dormancy strategy is applied to further enhance energy efficiency. The network energy consumption is then updated to reflect these changes. Figure 1 indicates the network model structure used in this research.
Figure 1

The network model structure. The network model setup process involves determining the optimal number of clusters, clustering sensor nodes based on energy consumption, implementing the entropy method to prioritize nodes, selecting CHs based on distance, energy, and information value, and employing energy division and dormancy strategies to enhance efficiency. The left figure is inspired by Zhao et al. (2018b).

Figure 1

The network model structure. The network model setup process involves determining the optimal number of clusters, clustering sensor nodes based on energy consumption, implementing the entropy method to prioritize nodes, selecting CHs based on distance, energy, and information value, and employing energy division and dormancy strategies to enhance efficiency. The left figure is inspired by Zhao et al. (2018b).

Close modal

Network setup

The model consists of N sensor nodes that are uniformly distributed in a circular area with a diameter of W. The BS is at the center of the network and has no energy restriction. This model considers the energy consumed by the sensor nodes during transmission, reception, and idle states.

The sensing range and transmission range of a sensor node are defined as circular areas centered at ξi, with radii of ri and Ri, respectively. The neighbor set of a sensor node consists of all sensor nodes located within a distance of Ri from the center of the transmission range, ξi. In a given area, the sensing and communication ranges of randomly distributed nodes are determined based on the maximum distance between any two adjacent sensor nodes. Let us consider two sensors, N1 and N2, with coordinates (xi, yi) and (xj, yj), respectively. The distance between these two sensors, D(i, j), can be calculated as follows:
(7)
The energy consumption in sensors can be attributed to the transmission and reception of data (Raghavendra et al. 2006). The energy consumed in transmitting a message of b bits over a distance of d, ETX, is calculated using
(8)

Here, Eelec represents the energy consumed by the transceiver, εfs and εmp are the transmitter amplifier in the free space and the multipath model, and d0 is the crossover distance given by . The energy consumed to receive the message, ERX, is quantified by . Therefore, the total energy is .

Optimal number of clusters

The network's energy consumption has a robust relationship with communication traffic. As the number of clusters increases, the inter-cluster energy consumption heightens, while the intra-cluster energy consumption declines. Therefore, the optimal number of clusters should be selected carefully. Zhao et al. (2018b) proposed a model for determining the optimal number of clusters based on the network structure model and energy consumption. It is assumed that the monitoring area is a circle with a diameter of W and an inline square is considered within the circular region. The clusters (k) in the square are assumed to be circular with a radius of R. The sensor network is divided into clusters, and the CH receives information from cluster member nodes and transmits it to the BS. For a non-CH node with the distant dnc < d0, the required energy (Enc) equals to ETX, . The energy dissipation by a CH to receive and transmit a message is defined as
(9)
where n is the number of present nodes, EDA is the energy consumed by the CH during processing, and the distance between the CH and the BS is represented by dBS. The energy model considers both the free space and the multipath fading channel when calculating energy consumption between clusters (Abdolabadi & Khosravian 2025). As W is greater than 2d0, the expectation of energy dissipation from the CH to the BS is .

The average energy consumed by a cluster . The energy consumed by all clusters in the region in one round is . Hence, the optimal number of clusters can be calculated as by taking the derivative of Esum with respect to k.

Clustering protocol

Hierarchical clustering is one of the widely used methods. At first, each of the nodes is considered as a cluster, and then, the distance between each node is calculated to form the distance matrix. Then, according to the closeness of the nodes to each other, they form a new cluster, and to some extent, it continues to reach the optimal number of k clusters. While the simplicity is one of the main advantages of this method, it is time-consuming especially for high-dimensional datasets. K-means clustering algorithm presents a solution to improve the efficiency.

K-means is an iterative algorithm used for clustering a set of objects into clusters where the objects within each cluster have similar characteristics (Pérez-Ortega et al. 2019). Let represent the set of n objects to be clustered based on a similarity criterion. For a k-cluster, of X, the centroid of cluster g(j) is denoted as μj for jK. The set of all centroids is represented as , and the set of weights is denoted as . The clustering problem can be formulated as an optimization problem:
(10)
where d is the Euclidean distance between each object xi and its corresponding centroid μj, weighted by the values of wij. The weights wij can only take the values of 0 or 1, indicating whether an object belongs to a particular cluster g(j). As the optimization problem is NP-hard, we used the crystal structure algorithm for its solution. Detailed information on this algorithm is provided in Talatahari et al. (2021).

CH selection

Our work builds upon the foundation laid by Zhao et al. (2018b), particularly their two-pronged CH selection strategy for general and large clusters. We extend this strategy by incorporating additional considerations that prioritize network longevity over data integrity. Specifically, we deviate from selecting CHs based solely on their proximity to the cluster center, distance from the BS, and residual energy. Instead, we introduce a modified selection process that considers the node with the highest information value (NHI) and prioritizes CHs located closer to NHI. This ensures that critical information is gathered and transmitted efficiently while also reducing the load on CHs.

The original strategy of Zhao et al. (2018b) proposes an energy-efficient clustering routing protocol that employs the general CH selection method for general clusters and the dual-cluster heads (D-CHs) division strategy for large clusters. The general CH selection algorithm selects the node with the maximum value of objective function GCH as the CH of cluster C. We modified the proposed objective function to explicitly consider NHI location in the objective function, ensuring that CH candidates closer to NHI are selected with higher probability.
(11)
where Re is the node residual energy, dCen, dBS, and represent the distance to the cluster center, the BS, and NHI, respectively. α is the relative weight assigned to the distance to the cluster center compared with the distance to the BS. The parameter β controls the overall weight of the proximity to NHI. A higher β value indicates a stronger preference for proximity to NHI, while a lower β value reduces its influence and emphasizes proximity to the cluster center and the BS. The term (1 − α/β) describes the relative weight assigned to proximity to NHI compared with the combined weight of proximity to the cluster center and the BS. represents the weight assigned to the distance to NHI.
The large cluster strategy involves two types of CHs: S-CHs, responsible for receiving information from cluster members, and P-CHs, responsible for merging and transmitting consolidated information to the BS. The P-CH and the S-CH have the highest and second-highest GCH values, respectively. To determine a large cluster, we need to calculate the average energy consumption of the CHs, , and the total energy consumption of a CH in an x-member cluster, E. A cluster is considered large if .
(12)
(13)

To further prolong the network lifetime, the protocol implements a node dormancy mechanism that selectively puts nodes with low energy and long distances from CHs into dormancy. This mechanism is activated only after the first node death and involves several steps. Firstly, dormancy factors (Sdor) are calculated for all cluster member nodes . The smaller the Sdor value for a node, the higher the probability of it becoming dormant. Next, the node dormancy ratio (R) is determined by , where n is the number of live nodes.

To assess the performance of the proposed algorithm on the lifetime of a WSN monitoring DO levels, we developed a hypothetical example involving a circular monitoring area with a 100-unit diameter. Within this area, 30 sensor nodes are randomly distributed, with the BS positioned at the center of the region. Each sensor was tasked with collecting DO data, with initial measurements assigned randomly within ranges of 3–12 ppm. Figure 2 shows the distribution of sensor nodes in the network topology and their random predefined data distribution. The simulation settings are summarized in Table 1. We used MATLAB 2016 on a computer with an Intel 5 core processor with 4 GB of RAM.
Table 1

Simulation parameters (Zhao et al. 2018b)

ParameterValue
Eelec 50 nJ/bit 
EDA 5 nJ/bit/message 
εfs 10 pJ/bit/m2 
εmp 0.0013 pJ/bit/m4 
The diameter of monitoring area, D 100 m 
Initial number of nodes, N 30 
Size of message, b 4,000 bits 
Initial energy 0.4 J 
ParameterValue
Eelec 50 nJ/bit 
EDA 5 nJ/bit/message 
εfs 10 pJ/bit/m2 
εmp 0.0013 pJ/bit/m4 
The diameter of monitoring area, D 100 m 
Initial number of nodes, N 30 
Size of message, b 4,000 bits 
Initial energy 0.4 J 
Figure 2

(a) The distribution of 30 sensor nodes in a 100-unit diameter network. The red star indicates the BS. (b) Radar plot of predefined random data distribution for each sensor node.

Figure 2

(a) The distribution of 30 sensor nodes in a 100-unit diameter network. The red star indicates the BS. (b) Radar plot of predefined random data distribution for each sensor node.

Close modal
We compared the protocol proposed by Zhao et al. (2018b) with the novel algorithm incorporating an information value approach to assess the WSN's lifetime considering the entropy theory and the minimum redundancy maximum information (MIRI). By effectively identifying and utilizing the most informative sensors, the algorithm further optimizes energy consumption to extend the selected sensors' lifetime. Figure 3 indicates the results of analyzing entropy indicators of each sensor node. As we produced DO values using the discrete uniform distribution, there is minute differences between amounts of uncertainty among sensor nodes.
Figure 3

The marginal entropy, mutual information, and the total correlation for each sensor.

Figure 3

The marginal entropy, mutual information, and the total correlation for each sensor.

Close modal
Solving the optimization MIRI problem results in selecting an optimal set of sensors, numbered , with the maximum total information content and information transfer, and minimum the redundant information. The multivariate entropy, mutual information, and the total correlation are 5.22, 0.7, and 0.6, respectively. Figure 4(a) depicts the location of selected sensors in the monitoring area. Once the nodes with higher entropy are determined, the optimal number of clusters is calculated and the clustering protocol is employed. Figure 4(b) indicates the cluster assignment at the first iteration. Afterwards, we analyze two scenarios. Initially, we execute the algorithm suggested by Zhao et al. (2018b). Subsequently, we implement the alteration in the suggested protocol. We examine both the suggested and existing models from the perspective of live nodes, network energy consumption, and residual energy analysis.
Figure 4

(a) The position of selected sensors with high information value in the monitoring area (red sensor nodes). (b) The cluster assignments at the first iteration.

Figure 4

(a) The position of selected sensors with high information value in the monitoring area (red sensor nodes). (b) The cluster assignments at the first iteration.

Close modal

Network lifetime

The network's lifetime is a crucial metric for evaluating the success of the proposed protocol. The survival of nodes directly impacts the network's lifetime, reflecting the efficacy of the proposed approach in terms of network longevity. Our research utilized the number of alive nodes to determine the network's lifespan. Figure 5 illustrates the performance evaluation of the current model compared with the traditional model in relation to the number of alive nodes. At the beginning, both the proposed and conventional models operate with 30 alive nodes. As the number of rounds progresses, the number of alive nodes decreases. Upon comparison, at round 1,258, the proposed model has 22 alive nodes, while the conventional model has none. Likewise, at round 1,274, the proposed model has 15 alive nodes, which represents 50% of the total nodes.
Figure 5

Alive node of the proposed model compared with the conventional model.

Figure 5

Alive node of the proposed model compared with the conventional model.

Close modal

Zhao et al. (2018b) provided a comprehensive analysis of network lifetime across various protocols. They highlight that while SEP1 builds upon LEACH by considering initial energy, its performance in homogeneous networks is similar to that of LEACH, as all nodes have the same initial energy. In addition, the number of surviving nodes over time for both SEP and LEACH remains closely aligned, indicating limited advantages. However, the advantages of DEEC2 become apparent with continued iterations, showing a notable extension of network lifetime compared with LEACH – by 8.93 and 12.37% in two homogeneous networks, respectively.

The key takeaway from Zhao et al.'s findings is that their protocol effectively addresses energy distribution among nodes, yet it still does not account for the value of information collected. The protocols they evaluated (LEACH, SEP, and DEEC) tend to elect CHs without considering energy levels adequately, which can lead to inefficient energy usage and premature node failure. In contrast, the information-centric approach prioritizes sensors based on both their energy levels and their ability to provide high-value data.

One of the key factors in examining WSNs is the network's lifetime based on the survival time of at least 40% of the sensors, which is well demonstrated in Figures 5 and 6. As shown in Figure 6(a), the energy consumption trend and network lifetime are uniform and balanced, with about 1,100 iterations keeping over 40% of the sensors active. However, the energy consumption in sensors with high information is similar to other ones. Figure 6(b) demonstrates how nodes with high information content can be sustained in the new model as opposed to the conventional model. The five selected nodes with high information content (represented by red lines) experience minimal energy loss and have extended lifetime. As a result, the recommended strategy effectively enhances the network's longevity by preserving nodes with high information. Furthermore, the proposed model surpassed the conventional algorithm.
Figure 6

(a) The energy consumption of each node by implementing the conventional algorithm (red lines just show selected sensor nodes with high information value). (b) Applying the proposed model indicates that selected sensors have the highest lifetime.

Figure 6

(a) The energy consumption of each node by implementing the conventional algorithm (red lines just show selected sensor nodes with high information value). (b) Applying the proposed model indicates that selected sensors have the highest lifetime.

Close modal

Residual network energy

Residual energy, a key metric for network lifetime, reflects the amount of energy remaining in the nodes after each round of data aggregation. Our proposed algorithm achieves the highest residual energy, with an average of 29%. This signifies that nodes retain more energy, leading to a potentially longer network lifespan. In contrast, the conventional algorithm exhibits lower residual energy levels (mean: 42%), as shown in Figure 7.
Figure 7

Residual energy under both conventional and proposed models. The proposed model demonstrates significantly higher residual energy compared with the conventional model.

Figure 7

Residual energy under both conventional and proposed models. The proposed model demonstrates significantly higher residual energy compared with the conventional model.

Close modal

In the initial rounds (up to about 800 rounds), both models exhibit similar energy consumption rates, as the network is in its early operational phase and nodes are functioning without significant disruption. After 800 rounds, the conventional model begins to show accelerated energy depletion. This behavior is likely due to the uniform energy consumption across nodes, leading to the premature depletion of nodes closer to the BS or those burdened with high communication loads. In contrast, the proposed model maintains a more gradual energy depletion rate, extending the network's operational lifespan. At 1,200 rounds, the residual energy of the proposed model is visibly higher than that of the conventional model. This indicates that the proposed model is more energy-efficient during this period, benefiting from its adaptive strategies that prioritize high information value nodes and balance the workload among CHs. Beyond 1,400 rounds, the conventional model nearly depletes its energy reserves, resulting in network failure. Meanwhile, the proposed model continues to function, with a notable residual energy percentage at this stage. Therefore, the proposed model sustains the WSN's operation well beyond the point where the conventional model fails. It extends the network's lifetime by approximately 40% compared with the conventional model. This improvement is crucial for applications requiring prolonged and uninterrupted data collection, such as environmental monitoring.

In this research, we developed a WSN model which accounts for monitoring DO levels. The model is based on an energy balanced model, introducing a method to determine CHs considering the information value of sensor nodes. The process involves determining the optimal number of clusters, clustering sensor nodes using a hybrid algorithm, and implementing the entropy method to identify significant nodes. CHs are selected based on distance, residual energy, and information value. Energy division and dormancy strategies are employed to enhance energy efficiency, with updates made to network energy consumption.

A comparison is made between the existing protocol by Zhao et al. (2018b) and our proposed protocol incorporating an information value approach, optimizing energy consumption and extending sensor lifetime. The optimization of the MIRI problem results in selecting an optimal set of sensors with maximum total information content and minimum redundant information. Multivariate entropy, mutual information, and total correlation values are provided. Two scenarios are analyzed, comparing the proposed and existing models in terms of live nodes, network energy consumption, and residual energy analysis. The network's lifetime is a critical metric for evaluating the proposed protocol's success, with the survival of nodes directly impacting network longevity. Performance evaluation shows that the proposed model maintains a higher number of alive nodes compared with the conventional model, with nodes with high information content experiencing minimal energy loss and extended lifetime. In simulations, the proposed model maintained 22 alive nodes at round 1,258, while the conventional model had none. This translates to a 50% survival rate at round 1,274, highlighting the effectiveness of the information-centric approach.

The proposed model outperforms the conventional algorithm in terms of network longevity. Residual energy, an essential metric for network lifetime, is highlighted, with the proposed algorithm achieving higher residual energy levels compared with the conventional approach. This indicates greater energy retention in nodes and potential for a longer network lifetime. The superior residual energy of the proposed model suggests enhanced energy efficiency and network longevity.

Finally, it should be noted that the proposed model has not been tested in scenarios where the network topology changes dynamically, such as in situations of sensor failures or environmental disruptions, making this a compelling topic for future research. Addressing these challenges by integrating robust disruption management strategies into WSNs could significantly enhance their resilience and adaptability. Future research should focus on developing algorithms capable of proactively reconfiguring network topologies in real time, ensuring continuous and high-quality data collection even under adverse conditions. Additionally, exploring scalable solutions for larger networks and diverse environmental settings will be critical as WSN applications expand. Such advancements would not only optimize WSN performance but also enhance their reliability in real-world applications like environmental monitoring, disaster response, and public health initiatives.

All relevant data are included in the paper or its Supplementary Information.

The authors declare there is no conflict.

1

Stable election protocol (Smaragdakis et al. 2004).

2

Distributed energy-efficient clustering (Javaid et al. 2013).

Abdolabadi
H.
&
Khosravian
E
. (
2025
)
Improving the Lifetime of Wireless Sensor Networks for Air Quality Monitoring Using Metaheuristic Algorithms
,
Pollution
,
11
(
2
),
425
-
439
.
doi: 10.22059/poll.2024.380231.2490
.
Abdolabadi
H.
,
Sarang
A.
,
Ardestani
M.
&
Mahjoobi
E.
(
2016
)
Eutrophication modeling using variable chlorophyll approach
,
International Journal of Environmental Research
,
10
(
2
),
273
290
.
doi: 10.22059/ijer.2016.57722
.
Abdulsalam
H. M.
,
Ali
B. A.
&
AlRoumi
E.
(
2018
)
Usage of mobile elements in Internet of Things environment for data aggregation in wireless sensor networks
,
Computers & Electrical Engineering
,
72
,
789
807
.
Adu-Manu
K. S.
,
Katsriku
F. A.
,
Abdulai
J.-D.
&
Engmann
F.
(
2020
)
Smart river monitoring using wireless sensor networks
,
Wireless Communications and Mobile Computing
,
2020
,
1
19
.
Ahmedi
F.
,
Ahmedi
L.
,
O'Flynn
B.
,
Kurti
A.
,
Tahirsylaj
S.
,
Bytyçi
E.
,
Sejdiu
B.
&
Salihu
A
. (
2018
)
Inwatersense: An intelligent wireless sensor network for monitoring surface water quality to a river in Kosovo
.
International Journal of Agricultural and Environmental Information Systems (IJAEIS
),
9 (1), 39–61. doi:10.4018/IJAEIS.2018010103
.
Al Aghbari
Z.
,
Khedr
A. M.
,
Osamy
W.
,
Arif
I.
&
Agrawal
D. P.
(
2020
)
Routing in wireless sensor networks using optimization techniques: a survey
,
Wireless Personal Communications
,
111
,
2407
2434
.
Alfonso
L.
,
Lobbrecht
A.
&
Price
R
. (
2010
)
Optimization of water level monitoring network in polder systems using information theory
.
Water Resources Research
,
46
(
12
),
W12553
.
doi:10.1029/2009WR008953
.
Ali
M.
,
Ling
G.
&
Elmouazen
H.
(
2023
)
‘Design and implementation of an embedded system for water quality monitoring (WQM) based on Internet of Things (IoT)’, Paper presented at the 2023 7th international conference on robotics, control and automation (ICRCA)
.
Arora
V. K.
,
Sharma
V.
&
Sachdeva
M.
(
2016
)
A survey on LEACH and other's routing protocols in wireless sensor network
,
Optik
,
127
(
16
),
6590
6600
.
Azharuddin
M.
,
Kuila
P.
&
Jana
P. K.
(
2013
)
‘A distributed fault-tolerant clustering algorithm for wireless sensor networks’, Paper presented at the 2013 international conference on advances in computing, communications and informatics (ICACCI)
.
Bharany
S.
,
Sharma
S.
,
Alsharabi
N.
,
Tag Eldin
E.
&
Ghamry
N. A.
(
2023
)
Energy-efficient clustering protocol for underwater wireless sensor networks using optimized glowworm swarm optimization
,
Frontiers in Marine Science
,
10
,
1117787
.
Chen
J.
,
Dai
Z.
,
Dong
S.
,
Zhang
X.
,
Sun
G.
,
Wu
J.
,
Ershadnia
R.
,
Yin
S.
&
Soltanian
M. R
. (
2022
)
Integration of deep learning and information theory for designing monitoring networks in heterogeneous aquifer systems
.
Water Resources Research
,
58
(
10
), p.
e2022WR032429
.
Dasig
D. D.
Jr
(
2019
)
Implementing zigbee-based wireless sensor network in the design of water quality monitoring system
,
International Journal of Recent Technology and Engineering
,
8
,
6174
6179
.
de Camargo
E. T.
,
Spanhol
F. A.
,
Slongo
J. S.
,
da Silva
M. V. R.
,
Pazinato
J.
,
de Lima Lobo
A. V.
,
Coutinho
F. R.
,
Pfrimer
F. W. D.
,
Lindino
C. A.
,
Oyamada
M. S.
&
Martins
L. D.
(
2023
)
Low-cost water quality sensors for IoT: A systematic review
.
Sensors
,
23 (9), 4424.
Del-Valle-Soto
C.
,
Rodríguez
A.
&
Ascencio-Piña
C. R
. (
2023
)
A survey of energy-efficient clustering routing protocols for wireless sensor networks based on metaheuristic approaches
.
Artificial Intelligence Review
,
56 (9), 9699–9770
.
Diakhate
I.
,
Niang
B.
,
Kora
A. D.
&
Faye
R. M.
(
2023
)
Optimization of wireless sensor networks energy consumption by the clustering method based on the firefly algorithm
,
Indonesian Journal of Electrical Engineering and Computer Science
,
29
(
3
),
1456
1465
.
Evangelakos
E. A.
,
Kandris
D.
,
Rountos
D.
,
Tselikis
G.
&
Anastasiadis
E.
(
2022
)
Energy sustainability in wireless sensor networks: an analytical survey
,
Journal of Low Power Electronics and Applications
,
12
(
4
),
65
.
Fanian
F.
&
Rafsanjani
M. K.
(
2019
)
Cluster-based routing protocols in wireless sensor networks: a survey based on methodology
,
Journal of Network and Computer Applications
,
142
,
111
142
.
Gherbi
C.
,
Aliouat
Z.
&
Benmohammed
M.
(
2017
)
A survey on clustering routing protocols in wireless sensor networks
,
Sensor Review
,
37
(
1
),
12
25
.
Guo
W.
&
Zhang
W.
(
2014
)
A survey on intelligent routing protocols in wireless sensor networks
,
Journal of Network and Computer Applications
,
38
,
185
201
.
Gurusamy
D.
&
Diriba
G.
(
2022
)
Sensor network and energy harvesting solutions towards water quality monitoring in developing countries
,
Wireless Personal Communications
,
127
(
4
),
2761
2779
.
Heinzelman
W. R.
,
Chandrakasan
A.
&
Balakrishnan
H.
(
2000
)
‘Energy-efficient communication protocol for wireless microsensor networks’, Paper presented at the Proceedings of the 33rd annual Hawaii international conference on system sciences
.
Heinzelman
W. B.
,
Chandrakasan
A. P.
&
Balakrishnan
H.
(
2002
)
An application-specific protocol architecture for wireless microsensor networks
,
IEEE Transactions on Wireless Communications
,
1
(
4
),
660
670
.
Jabbar
M. S.
,
Issa
S. S.
&
Ali
A. H.
(
2023
)
Improving WSNs execution using energy-efficient clustering algorithms with consumed energy and lifetime maximization
,
Indonesian Journal of Electrical Engineering and Computer Science
,
29
(
2
),
1122
1131
.
Javaid
N.
,
Qureshi
T. N.
,
Khan
A. H.
,
Iqbal
A.
,
Akhtar
E.
&
Ishfaq
M.
(
2013
)
EDDEEC: enhanced developed distributed energy-efficient clustering for heterogeneous wireless sensor networks
,
Procedia Computer Science
,
19
,
914
919
.
Keum
J.
,
Kornelsen
K. C.
,
Leach
J. M.
&
Coulibaly
P.
(
2017
)
Entropy applications to water monitoring network design: a review
,
Entropy
,
19
(
11
),
613
.
Khetre
A. C.
&
Hate
S. G.
(
2013
)
Automatic monitoring & reporting of water quality by using WSN technology and different routing methods
,
International Journal of Advanced Research in Computer Engineering & Technology
,
2
(
12
),
3255
3260
.
Kumari
C. U.
,
Lydia
E. L.
,
Murthy
A. S. D.
&
Kumar
M. N. V. S. S.
(
2020
)
Designing of wireless sensor nodes for providing good quality drinking water to the public
,
Materials Today: Proceedings
,
33
,
4250
4254
.
Li
C.
,
Singh
V. P.
&
Mishra
A. K
. (
2012
)
Entropy theory-based criterion for hydrometric network evaluation and design: Maximum information minimum redundancy
.
Water Resources Research
,
48
(
5
),
W05521
.
doi:10.1029/2011WR011251
.
Lindsey
S.
&
Raghavendra
C. S.
(
2002
)
‘PEGASIS: Power-efficient gathering in sensor information systems’, Paper presented at the Proceedings, IEEE aerospace conference
.
Liu
T.
&
Wu
F
. (
2022
)
[Retracted] A Sensor-Based IoT Data Collection and Marine Economy Collaborative Innovation Method
.
Computational Intelligence and Neuroscience
,
2022
(
1
),
3421999
.
Mahmood
D.
,
Javaid
N.
,
Mahmood
S.
,
Qureshi
S.
,
Memon
A. M.
&
Zaman
T.
(
2013
)
‘MODLEACH: a variant of LEACH for WSNs’, Paper presented at the 2013 Eighth international conference on broadband and wireless computing, communication and applications
.
Mazumdar
N.
&
Om
H.
(
2018
)
Distributed fuzzy approach to unequal clustering and routing algorithm for wireless sensor networks
,
International Journal of Communication Systems
,
31
(
12
),
e3709
.
Miller
M.
,
Kisiel
A.
,
Cembrowska-Lech
D.
,
Durlik
I.
&
Miller
T.
(
2023
)
IoT in water quality monitoring – are we really here?
Sensors
,
23
(
2
),
960
.
Mohammad
K.
,
Naji
H. R.
&
Golestani
S.
(
2012
)
‘Optimizing cluster-head selection in wireless sensor networks using genetic algorithm and harmony search algorithm’, Paper presented at the IEEE (20th Iranian Conference on Electrical Engineering (ICEE2012))
.
Nguyen
N.-T.
,
Liu
B.-H.
,
Pham
V.-T.
&
Liou
T.-Y.
(
2017
)
An efficient minimum-latency collision-free scheduling algorithm for data aggregation in wireless sensor networks
,
IEEE Systems Journal
,
12
(
3
),
2214
2225
.
Peng
Z.-r.
,
Yin
H.
,
Dong
H.-t.
&
Li
H.
(
2015
)
LEACH protocol based two-level clustering algorithm
,
International Journal of Hybrid Information Technology
,
8
(
10
),
15
26
.
Pérez-Ortega
J.
,
Almanza-Ortega
N. N.
,
Vega-Villalobos
A.
,
Pazos-Rangel
R.
,
Zavala-Díaz
C.
&
Martínez-Rebollar
A
. (
2019
)
The K-means algorithm evolution
.
Introduction to data science and machine learning
,
pp. 69–90
.
Pule
M.
,
Yahya
A.
&
Chuma
J.
(
2017
)
Wireless sensor networks: a survey on monitoring water quality
,
Journal of Applied Research and Technology
,
15
(
6
),
562
570
.
Raghavendra, C. S., Sivalingam, K. M. & Znati, T. (2006) Wireless Sensor Networks.
Germany
:
Springer US
.
Rajathi
L. V.
(
2023
)
An advancement in energy efficient clustering algorithm using cluster coordinator-based CH election mechanism (CCCH)
,
Measurement: Sensors
,
25
,
100623
.
Ran
G.
,
Zhang
H.
&
Gong
S.
(
2010
)
Improving on LEACH protocol of wireless sensor networks using fuzzy logic
,
Journal of Information &Computational Science
,
7
(
3
),
767
775
.
Ruddell, B. L. & Kumar, P. (2009)
Ecohydrologic process networks: 1. Identification
.
Water Resources Research
,
45
(
3
),
W03419
.
doi:10.1029/2008WR007279
.
Saputra
D.
,
Gaol
F. L.
,
Abdurachman
E.
,
Sensuse
D. I.
&
Matsuo
T.
(
2023
)
Architectural model and modified long range wide area network (LoRaWAN) for boat traffic monitoring and transport detection systems in shallow waters
,
Emerging Science Journal
,
7
(
4
),
1188
1205
.
Saravanan
K.
,
Anusuya
E.
,
Kumar
R.
&
Son
L. H.
(
2018
)
Real-time water quality monitoring using Internet of Things in SCADA
,
Environmental Monitoring and Assessment
,
190
,
1
16
.
Sert
S. A.
,
Bagci
H.
&
Yazici
A.
(
2015
)
MOFCA: multi-objective fuzzy clustering algorithm for wireless sensor networks
,
Applied Soft Computing
,
30
,
151
165
.
Shahraki
A.
,
Kuchaki Rafsanjani
M.
&
Borumand Saeid
A.
(
2017
)
Hierarchical distributed management clustering protocol for wireless sensor networks
,
Telecommunication Systems
,
65
,
193
214
.
Sharma
D.
,
Ojha
A.
&
Bhondekar
A. P.
(
2019
)
Heterogeneity consideration in wireless sensor networks routing algorithms: a review
,
The Journal of Supercomputing
,
75
(
5
),
2341
2394
.
Silva
G. M. e.
,
Campos
D. F.
,
Brasil
J. A. T.
,
Tremblay
M.
,
Mendiondo
E. M.
&
Ghiglieno
F.
(
2022
)
Advances in technological research for online and in situ water quality monitoring – a review
,
Sustainability
,
14
(
9
),
5059
.
Smaragdakis
G.
,
Matta
I.
&
Bestavros
A.
(
2004
)
‘SEP: a stable election protocol for clustered heterogeneous wireless sensor networks’, Paper presented at the Second international workshop on sensor and actor network protocols and applications (SANPA 2004)
.
Sridharan
S.
(
2014
)
Water quality monitoring system using wireless sensor network
,
International Journal of Advanced Research in Electronics and Communication Engineering (IJARECE)
,
3
(
4
),
399
402
.
Sukri
A. S.
,
Saripuddin
M.
,
Karama
R.
,
Talanipa
R.
,
Kadir
A.
&
Aswad
N. H.
(
2023
)
Utilization management to ensure clean water sources in coastal areas
,
Journal of Human, Earth, and Future
,
4
(
1
),
23
35
.
Talatahari
S.
,
Azizi
M.
,
Tolouei
M.
,
Talatahari
B.
&
Sareh
P.
(
2021
)
Crystal structure algorithm (CryStAl): a metaheuristic optimization method
,
IEEE Access
,
9
,
71244
71261
.
United Nations Department of Economic and Social Affairs
(
2022
)
The Sustainable Development Goals: Report 2022
.
UN: United States of America
.
Wang
W.
,
Wang
D.
,
Singh
V.P.
,
Wang
Y.
,
Wu
J.
,
Wang
L.
,
Zou
X.
,
Liu
J.
,
Zou
Y.
&
He
R
. (
2018
)
Optimization of rainfall networks using information entropy and temporal variability analysis
.
Journal of Hydrology
,
559
,
136
155
.
Zhao
L.
,
Qu
S.
&
Yi
Y.
(
2018a
)
A modified cluster-head selection algorithm in wireless sensor networks based on LEACH
,
EURASIP Journal on Wireless Communications and Networking
,
2018
(
1
),
1
8
.
Zhixiang
D.
&
Bensheng
Q.
(
2007
) '
Three-layered routing protocol for WSN based on LEACH algorithm
'.
Zulkifli
C. Z.
,
Garfan
S.
,
Talal
M.
,
Alamoodi
A. H.
,
Alamleh
A.
,
Ahmaro
I. Y.
,
Sulaiman
S.
,
Ibrahim
A. B.
,
Zaidan
B. B.
,
Ismail
A. R.
&
Albahri
O. S
. (2022)
IoT-based water monitoring systems: a systematic review
.
Water
,
14 (22), 3621
.
This is an Open Access article distributed under the terms of the Creative Commons Attribution Licence (CC BY 4.0), which permits copying, adaptation and redistribution, provided the original work is properly cited (http://creativecommons.org/licenses/by/4.0/).