<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Comparative Analysis of Data Redundancy Strategies for Wireless Sensor Networks in Smart Cities⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ashish Sharma</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sandeep Tayal</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yogesh Sharma</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Shivam Gangal</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jiya Verma</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vivek Kaushal</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <abstract>
        <p>Energy efficiency can be understood as getting desired outcome while consuming the least amount of energy possible. In context of wireless sensor networks (WSNs), tiny- battery-powered sensors work together to collect environmental data. These networks, often deployed in remote areas, rely on efficient energy use to function for extended periods. Since replacing batteries in these sensors can be difficult or impractical, maximizing their lifespan is critical. Therefore, designing WSNs with energy efficiency in mind is crucial. By minimizing energy consumption, WSNs can function for longer durations without intervention, leading to cost and effort reductions.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <sec id="sec-1-1">
        <title>1.1 Challenges in Energy Efficiency</title>
        <p>There are several challenges to consider when aiming to increase energy efficiency in WSNs:</p>
        <p>Limited Energy Resources: Sensor nodes rely on compact batteries with limited capacity,
necessitating efficient operation to stretch their lifespan. This highlights the importance of
maximizing energy use from these finite resources.
•
•
•</p>
        <p>Data Processing: Sensor nodes often perform data processing tasks before transmitting data.
These computations consume additional energy. Optimizing data processing algorithms and
techniques can help reduce energy consumption.</p>
        <p>Network Topology: The arrangement of sensor nodes and their connectivity affect energy
efficiency. Optimizing network topology, such as reducing the distance between nodes or
employing clustering techniques, is vital to balance energy consumption across the network.
Routing and Data Aggregation: Efficient routing protocols and data aggregation techniques
can significantly impact energy efficiency in WSNs. WSN mechanisms ensure data reaches the
base station efficiently by minimizing redundant transmissions.</p>
      </sec>
      <sec id="sec-1-2">
        <title>1.2 Early energy-efficient techniques in WSN</title>
        <p>Pioneering research on energy conservation in WSNs explored two key methods: Dynamic Power
Management (DPM) and Dynamic Voltage Scaling (DVS).</p>
        <p>Dynamic Power Management (DPM): This approach advocates for temporarily turning off unused
devices and reactivating them when needed. However, limitations exist. DPM relies on a combination of
operating system integration and probabilistic modelling to anticipate upcoming device usage patterns.</p>
        <p>Dynamic Voltage Scaling (DVS): This method adjusts power consumption based on the network's
workload. By dynamically changing voltage and frequency, DVS effectively reduces overall power usage.
The key lies in accurately predicting future workloads. Effective workload distribution hinges on
considering both ongoing tasks and predicted future demands.</p>
        <p>
          For embedded systems like Wireless Sensor Networks (WSNs) [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], conserving energy is critical. They
also face challenges in setting up the network, data aggregation, monitoring specific locations/objects,
and network safety. Despite these complexities, WSNs are a valuable tool for data acquisition in various
applications.
        </p>
        <p>
          Self-organizing WSNs equip sensor nodes with the ability to adapt through the use of adaptive
algorithms. This approach complements dynamic power allocation techniques used in IP networks,
which leverage power-saving modes, reliability, and prioritization techniques for reliable data delivery
[
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
        </p>
      </sec>
      <sec id="sec-1-3">
        <title>1.3 Energy Consumption in various phases of WSN</title>
        <p>
          Data transmission significantly impacts energy use in Wireless Sensor Networks (WSNs), outweighing
data processing. Transmitting a single data packet can consume roughly the same amount of energy as
processing thousands of functions within a sensor node. While the sensor unit's energy consumption
can fluctuate depending on the type of sensor, communication between nodes consistently represents
the largest consumer of energy in WSNs. Sensor data acquisition itself consumes negligible energy
compared to processing and communication [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
        <p>
          Consequently, energy-efficient techniques for WSNs primarily target communication protocols and
sensor operation. By combining various techniques, we can significantly extend the operational lifespan
of WSN deployments [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
        </p>
      </sec>
      <sec id="sec-1-4">
        <title>1.4 Strategies for energy efficiency to enhance energy efficiency in WSN</title>
        <p>Several strategies and techniques can be implemented:
•
•
•
•
•</p>
        <p>Sleep Scheduling: Sleep scheduling involves adjusting the duty cycle of nodes to reduce power
consumption. By letting nodes sleep during low-demand periods and waking them up only when
necessary, significant energy savings can be achieved.</p>
        <p>Data Compression: Data compression minimizes the information sent, reducing transmission
demands, thereby lowering communication energy consumption. Compression algorithms are
designed to minimize data size while retaining essential information.</p>
        <p>Energy Harvesting: Sensor nodes can leverage energy harvesting technologies to extract
power from their surroundings, like sunlight or vibrations, to supplement their battery power.
By utilizing renewable energy sources, the nodes can prolong their operational lifetime.
Dynamic Power Management: Dynamically adjusting the power levels of sensor nodes
according to the required operational level aids in optimizing energy consumption. Power
management algorithms are designed to balance operational needs with energy usage.
Cross-Layer Design: Collaboration among various layers of the network protocol stack can
result in energy-efficient designs. Cross-layer design facilitates improved coordination and
optimization between layers, leading to decreased energy consumption.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Energy Optimization Algorithms for Wireless Sensor Networks</title>
      <p>
        Addressing energy constraints is a significant challenge for Wireless Sensor Networks (WSNs) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ],
especially as their use grows in areas like environmental monitoring, smart agriculture, and industrial
automation. Prolonging the network’s operational life requires optimizing energy usage by deploying
effective algorithms [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <sec id="sec-2-1">
        <title>2.1 Energy Efficiency in Wireless Sensor Networks</title>
      </sec>
      <sec id="sec-2-2">
        <title>2.1.1 Understanding Energy Efficiency</title>
        <p>Energy efficiency is a key principle in any system, aiming to achieve desired outcomes while minimizing
energy consumption. In Wireless Sensor Networks (WSNs), where sensor nodes usually depend on
limited battery power, energy efficiency is critical. By optimizing energy use, WSNs can extend their
operational lifetime, minimizing disruptions caused by battery depletion or the need for frequent
replacements.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.1.2 Factors Affecting Energy Consumption in WSNs</title>
        <p>Understanding the factors that contribute to energy consumption helps in identifying optimization
opportunities. This section examines the primary factors influencing energy efficiency in Wireless
Sensor Networks (WSNs):
•
•
•
•
•</p>
        <p>Transmitting Data: Transmitting data requires a substantial amount of energy. This includes
both radio transmission and data processing.</p>
        <p>Receiving Data: Receiving data also requires energy, as the node needs to remain active and
process the incoming data.</p>
        <p>Sensing Environment: Sensing the environment using sensor nodes demands energy,
particularly in cases where sensors need to sample and analyze data frequently.</p>
        <p>Communication Range: Larger communication ranges necessitate higher transmission power,
leading to increased energy consumption.</p>
        <p>Data Aggregation: Combining sensor data before transmission minimizes the number of
transmissions required, leading to significant energy conservation in WSNs.</p>
      </sec>
      <sec id="sec-2-4">
        <title>2.2 Optimization Algorithms for Energy Efficiency</title>
      </sec>
      <sec id="sec-2-5">
        <title>2.2.1 Adaptive Duty Cycling</title>
        <p>Adaptive Duty Cycling (ADC) is a prominent optimization technique employed to reduce energy
consumption in wireless sensor networks. It seeks to find a balance between energy conservation and
the timely delivery of data.</p>
      </sec>
      <sec id="sec-2-6">
        <title>2.2.2 Topology Control</title>
        <p>WSN efficiency hinges on topology control algorithms, which optimize network structure to minimize
energy use. By selectively activating certain nodes and adjusting transmission power levels, topology
control algorithms minimize energy wastage.</p>
      </sec>
      <sec id="sec-2-7">
        <title>2.2.3 Data Aggregation Techniques</title>
        <p>Data aggregation techniques focus on reducing the amount of data transmitted by merging similar or
redundant information into a single message. By aggregating data in a localized manner, energy
consumption is significantly reduced since the number of transmissions is minimized.</p>
      </sec>
      <sec id="sec-2-8">
        <title>2.2.4 Routing Protocols</title>
        <p>Routing protocols play a vital role in energy efficiency as they determine the paths through which data
is transmitted in the network. Examples of energy-efficient routing protocols include Low-Energy
Adaptive Clustering Hierarchy (LEACH), Directed Diffusion, and Minimum Hop Routing (MHR).</p>
      </sec>
      <sec id="sec-2-9">
        <title>2.2.5 Sleep Scheduling</title>
        <p>Algorithms aim to strategically put sensor nodes into a deep sleep mode for extended periods to conserve
energy. By coordinating sleep schedules across the network, energy consumption is reduced while
ensuring connectivity and data delivery.</p>
        <p>•
•
•
•
•
•
3. Techniques and Algorithms for Data Redundancy Reduction in Wireless</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Sensor Networks (Wsns)</title>
      <p>
        Data redundancy reduction techniques are essential for enhancing the efficiency and performance of
Wireless Sensor Networks (WSNs) by decreasing the volume of redundant information transmitted and
stored [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Below are some common techniques employed for data redundancy reduction in WSNs:
      </p>
      <sec id="sec-3-1">
        <title>3.1 Data Aggregation</title>
        <p>
          Data aggregation is a cornerstone in Wireless Sensor Networks (WSNs), playing a pivotal role in
optimizing network efficiency, conserving resources, and extending network lifespan. This section
elucidates the essence of data aggregation, its significance, and diverse implementation methods,
positioning it as a vital technique for maximizing WSN efficiency [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.1.1 Essence of Data Aggregation</title>
        <p>
          Data aggregation encompasses the in-network processing of raw sensor data, here intermediate nodes
perform operations such as averaging, summation, or selection to generate aggregated data. This data is
subsequently transmitted towards the sink node, hence reducing the overall volume of transmitted data
and conserving network resources [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
        </p>
        <p>It is characterized by resource-constrained sensor nodes, and the direct transmission of raw data to
the sink node poses significant challenges such as energy depletion and network congestion. Data
aggregation faces the challenges of:</p>
        <p>Reducing Transmission Overhead: By processing data closer to the source, data aggregation
minimises the number of packets transmitted, hence conserving energy.</p>
        <p>Mitigating Network Congestion: The reduced data volume reduces congestion on
communication channels, thus enhancing overall network performance.</p>
        <p>Extending Network Lifetime: Lower energy consumption due to fewer transmissions
translates to a prolonged network lifespan, enhancing sustainability.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.1.2 Implementation of Data Aggregation</title>
        <p>The implementation of data aggregation in WSNs occurs at different levels within the network
hierarchy:</p>
        <p>In-node Aggregation: Individual sensor nodes process the sensed data locally before
transmission.</p>
        <p>Cluster-based Aggregation: Sensor nodes are grouped into clusters, where cluster heads are
tasked with aggregating data from member nodes before transmitting it to the sink.
Tree-based Aggregation: Nodes form a tree structure where data is progressively aggregated
as it ascends towards the sink, offering flexibility in data routing.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.1.3 Parameters for Effective Aggregation</title>
        <p>The effectiveness of data aggregation techniques hinges on several parameters, including:
•
•</p>
        <p>Aggregation Function: The choice of aggregation function (e.g., mean, median) that influences
the level of information preservation at the time of aggregation.</p>
        <p>Data Correlation: The degree of similarity between data from neighbouring nodes that affect
the potential for efficient aggregation.
•</p>
        <p>Network Topology: The spatial distribution of sensor nodes and the presence of cluster heads
pushing data forwarding paths and aggregation opportunities.</p>
      </sec>
      <sec id="sec-3-5">
        <title>3.1.4 Methods for Data Aggregation</title>
        <p>Various methods have been proposed for implementing data aggregation in WSNs, each offering distinct
advantages and limitations:
•
•
•
•
•</p>
        <p>
          Min-Max Aggregation: Provides a concise overview of data trends by transmitting minimum
and maximum values but may sacrifice detailed information [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
        </p>
        <p>
          Mean Aggregation: Calculates the average of sensed data, summarising statistically similar
data but potentially overlooking outliers [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
        </p>
        <p>
          Median Aggregation: Offers robustness to outliers compared to the mean but may necessitate
more complex calculations [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
        </p>
        <p>
          Histogram Aggregation: Constructs histograms locally to capture data distribution without
transmitting raw data, suitable for applications requiring data distribution insights [9].
Fuzzy Aggregation: Utilizes fuzzy logic to handle uncertainty in sensor data, particularly
beneficial for environmental monitoring applications [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
        </p>
        <p>Innovating data aggregation techniques in WSNs enhances efficiency, reliability, and data fidelity,
driving advancements across various applications and ensuring sustainable, efficient network
operations.</p>
        <p>Data aggregation guarantees a reduction in redundancy, ensuring that results are retained. This
analysis reveals that the proposed algorithm exhibits improved network longevity and better energy
consumption compared to other traditional algorithms.</p>
      </sec>
      <sec id="sec-3-6">
        <title>3.2 Data compression</title>
        <p>A data compression tool is a valuable tool for improving the efficiency and effectiveness of wireless
sensor networks (WSNs). Network lifecycle provides an in-depth into the concept of data compression,
its essence in reducing redundancy, various methods used in WSNs, and implementation of the same.</p>
      </sec>
      <sec id="sec-3-7">
        <title>3.2.1 Essence of Data Compression</title>
        <p>Data compression involves encoding data in a manner that minimizes the amount of storage required.
WSNs are marked by resource-constrained sensor nodes, which have limited battery power and
bandwidth. Data compression solves the redundancy problem by providing the following:</p>
        <p>Reduced transmission Load: Compression reduces the number of transmissions by removing
redundant data, leading to considerable energy savings. By eliminating redundant data, compression
minimizes the number of bits transmitted, leading to significant energy savings. This can be calculated
using the formula:</p>
        <p>
          Energy Saved (%) = (1 - Compression Ratio) * 100
(1) [
          <xref ref-type="bibr" rid="ref9">10</xref>
          ]
        </p>
        <p>Improved scalability: Reduces transfer rates can handle larger data, improving network scalability
for dense sensor deployment.</p>
        <p>
          Extending Network Lifetime: Reduced transmission translates to lower energy consumption,
ultimately extending the operational lifespan of the network [
          <xref ref-type="bibr" rid="ref10">11</xref>
          ].
        </p>
      </sec>
      <sec id="sec-3-8">
        <title>3.2.2 Implementation of Data Compression</title>
        <p>Data Compression can occur at various levels due to its applicability being extremely diverse and
effective in ensuring the reduction of repetition. Its functionality at different levels of WSN can be seen
effectively as:</p>
        <p>Intra-node compression: Intra-node compression: Each sensor node compresses the detected
data before transmission, hence reducing node transmission overhead.</p>
        <p>Network-wide compression: Data can be compressed at a specific network location (such as
a card) before being sent to the recipient.</p>
      </sec>
      <sec id="sec-3-9">
        <title>3.2.3 Compression quality parameters</title>
        <p>The effectiveness of data compression technology in Wireless Sensor Networks (WSNs) relies on several
parameters. Taking a broader look at these aspects, we can observe:</p>
        <p>Compression ratio: This parameter is determined by the compression algorithm. The smaller
the size of the result files, the higher the ratio means more reductions. Formula:</p>
        <p>
          Compression Ratio = Original Size / Compressed Size
(2) [
          <xref ref-type="bibr" rid="ref9">10</xref>
          ]
Features: Features of useful data (such as data type and classification) usually affect the
suitability of various methods
Computational complexity: The energy required for compression affects overall network
efficiency and performance. For resource-constrained sensor nodes, fewer algorithms are
preferred as complex algorithms consume excess energy.
•
•
•
•
•
•
•
        </p>
      </sec>
      <sec id="sec-3-10">
        <title>3.2.4 Data compression methods</title>
        <p>Many data compression methods have been examined for use in WSN, each method has advantages and
limitations. Some would be:</p>
        <p>
          Lossless Compression: Huffman Coding and Lempel-Ziv (LZ) Coding allows the
reconstruction of the original material after decompression. These methods ensure the
applications where data accuracy is important, but they may not always achieve the highest
compression ratio [
          <xref ref-type="bibr" rid="ref11">12</xref>
          ].
        </p>
        <p>
          Lossy compression: Techniques such as quantization and transfer coding permit data loss to
be controlled in exchange for a higher compression ratio. This method is suitable for applications
•
that result in some loss of quality data, such as environmental monitoring where small
temperature changes may not make a bigger impact [
          <xref ref-type="bibr" rid="ref11">12</xref>
          ].
        </p>
        <p>
          Dictionary-based compression: This method exploits recurring patterns in data by creating a
dictionary of frequently encountered words hence keeping a record. Characters or segments of
data are encountered, stored and further used. This approach can achieve similar results for
devices with core components but requires additional dictionary management and deployment
overhead [
          <xref ref-type="bibr" rid="ref12">13</xref>
          ].
        </p>
        <p>The choice of data compression technology in Wireless Sensor Networks (WSNs) depends on
application requirements and network constraints, with various parameters influencing the decision
Balancing compression ratio and data integrity is essential in many WSN applications.</p>
      </sec>
      <sec id="sec-3-11">
        <title>3.3 Predictive Modelling</title>
        <sec id="sec-3-11-1">
          <title>Method</title>
        </sec>
        <sec id="sec-3-11-2">
          <title>Description</title>
        </sec>
        <sec id="sec-3-11-3">
          <title>Advantages</title>
        </sec>
        <sec id="sec-3-11-4">
          <title>Disadvantage</title>
        </sec>
        <sec id="sec-3-11-5">
          <title>Most Suitable for Data</title>
          <p>Sensor readings
with
highfidelity
requirements
Sensor readings
where a certain
level of accuracy
is tolerable (e.g.,
temperature
monitoring)
Sensor readings
with recurring
patterns (e.g.,
environmental
monitoring)
Lossless
Compression
Lossy
Compression</p>
          <p>Techniques like Huffman
coding and Lempel-Ziv (LZ)
coding achieve perfect
reconstruction of the original
data after decompression.</p>
          <p>Techniques like quantization
and transform coding allow
for controlled data loss in
exchange for higher
compression ratios.</p>
          <p>Guarantees
data integrity
Achieves
higher
compression
ratios</p>
          <p>May not
achieve the
highest
compression
ratios
Introduces data
loss
Dictionary- These methods exploit Highly Requires
based repetitive patterns within the effective for additional
Compression data by creating dictionaries data with overhead for
of frequently occurring redundancy dictionary
symbols or data segments, management
achieving high compression
for data.</p>
          <p>
            Predictive modelling in Wireless Sensor Networks (WSNs) forecasts future sensor readings from
historical data patterns, reducing data redundancy through analysis of algorithms, implementation
methods, and various techniques for improved efficiency and effectiveness. It entails creating
mathematical models to forecast future outcomes based on historical data, which can be either recent or
significantly older to enhance accuracy [
            <xref ref-type="bibr" rid="ref13">14</xref>
            ]. In WSNs, predictive models analyse past sensor readings to
forecast future values, enabling proactive decisions.
          </p>
        </sec>
      </sec>
      <sec id="sec-3-12">
        <title>3.3.1 The Essence of Predictive Modelling</title>
        <p>Predictive modelling in Wireless Sensor Networks (WSNs) forecasts future sensor values using historical
data, reducing data transmission by sending only differences or selective updates. This decreases energy
consumption, extends operational lifespan, and enhances scalability, accommodating larger networks
with minimal bandwidth limitations.</p>
        <p>Overall, predictive modelling comes as a powerful technique for data redundancy reduction in WSNs,
contributing to improved energy efficiency, prolonged network lifetime, and enhanced scalability.</p>
      </sec>
      <sec id="sec-3-13">
        <title>3.3.2 Implementation of Predictive Modelling</title>
        <p>Predictive modelling for redundancy reduction in WSNs can be implemented in various ways:
•
•
•
•
•
•</p>
        <p>In-node Prediction: Individual sensor nodes employ local prediction models to present their
future values. This approach minimises communication overhead but requires sufficient
processing power on each node.</p>
        <p>Cluster-based Prediction: Sensor nodes in a cluster further collaborate, sending only the
prediction error or raw data exceeding a certain error threshold limitation to the cluster head for
additional processing.</p>
        <p>Centralised Prediction: Sensor data is sent to a central node (sink) for comprehensive
prediction using more sophisticated and complex models.</p>
        <p>
          The optimal implementation strategy depends on the network architecture, resource constraints, and
desired trade-off between prediction accuracy and communication efficiency [
          <xref ref-type="bibr" rid="ref14">15</xref>
          ].
        </p>
      </sec>
      <sec id="sec-3-14">
        <title>3.3.3 Evaluation Parameters</title>
        <p>The effectiveness of predictive modelling techniques in WSNs is evaluated using several parameters:
Prediction Accuracy: Measured using metrics such as Mean Squared Error (MSE) or Mean
Absolute Error (MAE), lower values signify more accurate predictions.</p>
        <p>
          Energy Consumption: The total energy spent on model training, prediction, and data
transmission comprehends resource evaluation based on the provided network [
          <xref ref-type="bibr" rid="ref15">16</xref>
          ].
Computational Complexity: The processing resources required for training and executing
predictive models to ensure error-free results.
        </p>
      </sec>
      <sec id="sec-3-15">
        <title>3.3.4 Methods and Algorithms involved in Predictive Models</title>
        <p>Several algorithms have been explored for predictive modelling in WSNs, each offering distinct
advantages and limitations. Most are used on provided networks and their functionality keeping in mind
the evaluation parameters. These common algorithms would be:</p>
        <p>Auto-Regressive Integrated Moving Average (ARIMA): This widely used time series forecasting
method leverages past observations and their lagged values to estimate future values.</p>
        <sec id="sec-3-15-1">
          <title>Formula:</title>
        </sec>
        <sec id="sec-3-15-2">
          <title>Simplified Formula: Where:</title>
          <p>=  +  
 −  +   
−  +. . . + 
−  +</p>
          <p>
            −  + 

=  +   ∗  ( −  ) + 
∗  ( −  )
(3) [
            <xref ref-type="bibr" rid="ref16">17</xref>
            ]
(4) [
            <xref ref-type="bibr" rid="ref16">17</xref>
            ]
          </p>
          <p>Yt: Predicted value at time t; c: Constant term; φ: Autoregressive coefficient; θ: Moving
average coefficients; ε: White noise error term at time t</p>
          <p>
            Kalman Filter: This recursive estimation technique is well-suited for scenarios with dynamic sensor
data and incorporates process noise for more accurate predictions [
            <xref ref-type="bibr" rid="ref17">18</xref>
            ].
          </p>
        </sec>
        <sec id="sec-3-15-3">
          <title>Kalman Filter Equations (Simplified):</title>
          <p>State prediction: X_k = A * X_(k-1) + B * U_k</p>
          <p>
            Covariance prediction: P_k = A * P_(k-1) * A^T + Q_k
Kalman Gain: K_k = P_k * H^T * (H * P_k * H^T + R_k)^(-1)
State update: X_k^est = X_k + K_k * (Z_k - H * X_k)
Covariance update: P_k^est = (I - K_k * H) * P_k
(5) [
            <xref ref-type="bibr" rid="ref17">18</xref>
            ]
(6) [
            <xref ref-type="bibr" rid="ref9">10</xref>
            ]
(7) [
            <xref ref-type="bibr" rid="ref17">18</xref>
            ]
(8) [
            <xref ref-type="bibr" rid="ref17">18</xref>
            ]
(9) [
            <xref ref-type="bibr" rid="ref17">18</xref>
            ]
          </p>
        </sec>
        <sec id="sec-3-15-4">
          <title>Where:</title>
          <p>
            X_k: State vector at time k; A: State transition matrix; B: Control input matrix; U_k: Control
input at time k [
            <xref ref-type="bibr" rid="ref17">18</xref>
            ]; P_k: Covariance matrix at time k; Q_k: Process noise covariance matrix [
            <xref ref-type="bibr" rid="ref9">10</xref>
            ]; H:
Observation matrix; R_k: Measurement noise covariance matrix; Z_k: Measurement at time k;
X_k^est: Estimated state at time k; P_k^est: Estimated covariance matrix at time k [
            <xref ref-type="bibr" rid="ref17">18</xref>
            ].
          </p>
          <p>Artificial Neural Networks (ANNs): These data-driven models can learn complex relationships
within sensor data and offer superior prediction accuracy, particularly for non-linear patterns. However,
they often require significant training data and computational resources.</p>
          <p>Linear Regression: Linear regression estimates the relationship between independent variables.</p>
        </sec>
        <sec id="sec-3-15-5">
          <title>Formula:</title>
          <p>
            y = mx + b
(10) [
            <xref ref-type="bibr" rid="ref14">15</xref>
            ]
          </p>
        </sec>
        <sec id="sec-3-15-6">
          <title>Where:</title>
          <p>x and dependent variable; y by fitting a straight line to the data points.</p>
          <p>
            Support Vector Machines (SVM): Support Vector Machines (SVM) create a hyperplane in a
highdimensional space to categorize data points and forecast future outcomes [
            <xref ref-type="bibr" rid="ref14">15</xref>
            ].
          </p>
          <p>
            Predictive modelling offers a compelling approach for redundancy reduction in WSNs, but its
efficiency and effectiveness depend on various factors [
            <xref ref-type="bibr" rid="ref18">19</xref>
            ]:
•
•
•
          </p>
          <p>Data Characteristics: Data with strong temporal correlation (e.g., temperature readings) is
more suitable for accurate predictions compared to rapidly changing data (e.g., seismic activity).
Computational Complexity: The training and execution of complex models (e.g., ANNs) can
be computationally expensive for resource-constrained sensor nodes.</p>
          <p>Communication Overhead: While predictive models aim to reduce overall data transmission,
the communication cost associated with transmitting prediction errors or raw data exceeding
thresholds needs to be balanced with the gains in reduced redundant data transmission.</p>
        </sec>
      </sec>
      <sec id="sec-3-16">
        <title>3.4 Temporal Correlation</title>
      </sec>
      <sec id="sec-3-17">
        <title>3.4.1 Energy Conservation in WSNs</title>
        <p>
          The limited battery life of sensor nodes poses a significant challenge in Wireless Sensor Networks
(WSNs) [
          <xref ref-type="bibr" rid="ref19">20</xref>
          ]. This paper explores temporal correlation exploitation, a powerful technique that leverages
the inherent redundancy in sensor data collected over time to achieve this goal.
        </p>
      </sec>
      <sec id="sec-3-18">
        <title>3.4.2 Temporal Correlation and its Exploitation</title>
        <p>Temporal correlation refers to the tendency of sensor readings to exhibit similar values over short time
intervals. Several algorithms have been developed for temporal correlation exploitation in WSNs. We
discuss two common approaches:</p>
        <p>
          Threshold-based Algorithms: These algorithms define a threshold value (δ). If the difference
between the current sensor reading (S(t)) and the previously transmitted reading (S(t-1)) is below the
threshold, the data is deemed redundant and will not be transmitted [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ].
        </p>
        <p>Formula: Transmit data only
if</p>
        <p>
          |S(t) - S(t-1)| &gt; δ (11) [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]
        </p>
        <p>Predictive Algorithms: These algorithms predict future sensor readings based on past readings and
statistical models. If the predicted value falls within a certain error margin (ε) of the actual reading, the
data is deemed redundant.</p>
        <p>
          Formula: Transmit data only
if|S(t) - S'(t)| &gt; ε
(12) [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]
        </p>
        <sec id="sec-3-18-1">
          <title>Where:</title>
          <p>S'(t): Predicted value for time t.</p>
          <p>The specific formulas and parameters used may vary depending on the chosen algorithm and
application requirements.</p>
        </sec>
      </sec>
      <sec id="sec-3-19">
        <title>3.4.3 Advantages of Temporal Correlation Exploitation</title>
        <p>There are several compelling reasons to employ temporal correlation exploitation in WSNs:</p>
        <p>Reduced Data Transmission: By eliminating redundant data transmissions, the technique
significantly reduces energy consumption, leading to a prolonged network lifetime.</p>
        <p>Improved Network Scalability: By minimizing data traffic on the network, temporal correlation
exploitation can potentially handle a larger number of sensor nodes without compromising performance.</p>
        <p>Extended Sensor Lifetime: Reduced communication translates to lower energy expenditure by
individual sensor nodes, thereby extending their operational lifespan.</p>
      </sec>
      <sec id="sec-3-20">
        <title>3.4.4 Applications in WSNs</title>
        <p>Temporal correlation exploitation finds application in various WSN deployments, including:</p>
        <p>Environmental Monitoring: Sensor readings for temperature, humidity, and pressure often exhibit
slow temporal variations, making this technique highly effective.</p>
        <p>Structural Health Monitoring: In monitoring bridges or buildings, sensor readings typically show
gradual changes, allowing for efficient data reduction.</p>
        <p>Target Tracking: While target location may change over time, the movement is likely to be gradual,
enabling this technique to reduce redundant location updates.</p>
      </sec>
      <sec id="sec-3-21">
        <title>3.4.5 Implementation Parameters</title>
        <p>The effectiveness of temporal correlation exploitation hinges on several key parameters:</p>
        <p>Sampling Rate: The frequency of data sampling significantly impacts the technique's performance.
A higher sampling rate captures more detailed information but reduces redundancy reduction potential.</p>
        <p>Threshold Value (δ) or Error Margin (ε): These parameters determine the sensitivity of the
technique. A stricter threshold (lower δ or ε) transmits more data but reduces redundancy, while a looser
threshold (higher δ or ε) transmits less data but risks missing important changes.</p>
        <p>Data Compression Techniques: Integrating temporal correlation with data compression
techniques can further improve efficiency by minimizing the size of the transmitted data packets.</p>
      </sec>
      <sec id="sec-3-22">
        <title>3.4.6 Implementation Methods</title>
        <p>There are two primary implementation methods for temporal correlation exploitation:</p>
        <p>Local (in-node) Processing: In this approach, individual sensor nodes perform the necessary
computations and comparisons (threshold-based) or predictions (predictive algorithms) to determine if
data transmission is necessary.</p>
        <p>In-network Processing: This method aggregates data from multiple sensor nodes and performs the
correlation analysis at a central node or aggregator node.</p>
        <p>The selection of an implementation method is influenced by factors such as network topology, the
processing capabilities of sensor nodes, and the intended level of data aggregation.</p>
      </sec>
      <sec id="sec-3-23">
        <title>3.4.7 Future Research Prospects for Temporal Correlation Exploitation in WSNs</title>
        <p>Temporal correlation exploitation in WSNs reduces redundancy, with future research focusing on
enhancing its efficiency and broader applicability. Here, we explore some promising directions:
•
•
•
•
•</p>
        <sec id="sec-3-23-1">
          <title>Deep Learning for Adaptive Correlation Analysis: Current algorithms use pre-defined</title>
          <p>thresholds for correlation analysis.</p>
        </sec>
        <sec id="sec-3-23-2">
          <title>Hybrid Approaches with Compressed Sensing: Integrating temporal correlation</title>
          <p>exploitation with compressed sensing could enhance sparse signal acquisition and
reconstruction.</p>
        </sec>
        <sec id="sec-3-23-3">
          <title>Exploiting Spatial and Temporal Correlations: Future research could explore techniques</title>
          <p>that jointly exploit spatial and temporal correlations in dense WSN deployments to reduce data
redundancy.</p>
        </sec>
        <sec id="sec-3-23-4">
          <title>Security Considerations for Correlation Analysis Techniques: Implementing temporal</title>
          <p>correlation exploitation algorithms may create security vulnerabilities in WSNs, allowing
malicious actors to manipulate data.</p>
          <p>Energy-Aware Algorithm Design: Exploring algorithms computing techniques could
minimize the energy consumption of temporal correlation exploitation in WSN, despite reduced
data transmission.</p>
          <p>By investigating these promising research avenues, we can improve the efficiency and applicability
of temporal correlation exploitation in Wireless Sensor Networks (WSNs). This will ultimately result in
the creation of more resilient, energy-efficient, and secure sensor networks capable of gathering and
transmitting essential data over extended periods.
4. Comparative Analysis of Techniques for Data Redundancy Reduction
in Wireless Sensor Networks (Wsns)</p>
          <p>In Wireless Sensor Networks (WSNs), managing data redundancy is crucial for optimizing network
efficiency, energy consumption, and overall performance. Various techniques address these challenges,
each with unique advantages and limitations.This enhances energy efficiency and scalability, especially
in high-correlation scenarios.</p>
          <p>Data compression encodes sensor data more efficiently, reducing transmission load while conserving
resources. However, techniques vary in compression ratios and computational complexity, with lossy
methods potentially compromising data fidelity. Predictive modeling uses historical data to forecast
future values, allowing nodes to transmit only prediction errors, which effectively reduces redundancy
but may struggle in dynamic environments and require significant computational resources.</p>
          <p>Spatial and Temporal Correlation Exploitation identifies and eliminates redundant sensor data,
enhancing energy efficiency and minimizing unnecessary transmissions. While effective in predictable
environments, it can struggle with heterogeneous data distributions. Choosing the right redundancy
reduction technique in Wireless Sensor Networks (WSNs) depends on data characteristics, application
needs, and computational constraints, requiring careful evaluation for optimal performance and resource
utilization.
Predictive
Modelling
Spatial and
Temporal
Correlation
Exploitation
High
Moderate</p>
          <p>Moder
ate
Moder
ate</p>
          <p>High
compression
ratio</p>
          <p>High for
moderate
compression
Effective for
temporal
correlation,
reduces
overhead
Captures both
spatial &amp;
temporal
redundancy</p>
          <p>Varies by
model, high
for
stationary
data
Depends on
correlation
strength</p>
          <p>Increased
complexity</p>
          <p>Various data
types
Training
data,
complex
models
Complex
algorithms,
processing
power</p>
          <p>Data with
strong
temporal
trends
Highly
correlated
data</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>5. Conclusion</title>
      <p>Wireless Sensor Networks (WSNs) are crucial in a range of applications, including environmental
monitoring and industrial automation. However, one major challenge in deploying WSNs is ensuring
energy efficiency, as sensor nodes have limited battery life. Data transmission is a major factor for energy
drain, so minimizing redundant data transmissions is crucial for extending network lifetime. This paper
explores various energy-efficient strategies aimed at optimizing WSN performance.</p>
      <p>Researchers aim to enhance performance and lifetime by employing data redundancy reduction
techniques, optimization algorithms, and other energy-efficient strategies. Techniques like data
aggregation and compression reduce transmitted data volume while improving accuracy and processing
efficiency, significantly boosting overall network performance.</p>
      <p>As WSN technology continues to evolve, advancements in hardware design, communication
protocols, and data processing techniques will further contribute to achieving optimal energy efficiency
in these versatile sensor networks.</p>
      <p>In summary, by employing data redundancy techniques and utilizing optimization algorithms, we can
significantly lower energy consumption and enhance the overall efficiency of Wireless Sensor Networks.</p>
    </sec>
    <sec id="sec-5">
      <title>6. Future Scopes</title>
      <p>While significant advancements have been made in energy-efficient techniques for WSNs, there's
immense potential for further exploration and innovation. Here, we delve into some promising future
research directions:
•
•
•</p>
      <p>Artificial Intelligence and Machine Learning for Dynamic Optimization
Energy-Harvesting Advancements</p>
      <p>Security Considerations for Energy-Efficient Techniques</p>
      <p>By actively pursuing these promising research areas, we can improve the energy efficiency, extend
the operational lifespan, and strengthen the overall security of Wireless Sensor Networks, facilitating
their broader use in various essential applications.
- A Review,”
[9] G. Kollios, J. Byers, J. Considine, M. Hadjieleftheriou and F. Li, “Robust Aggregation in Sensor</p>
      <p>Networks”.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>. I. F.</given-names>
            <surname>Akyildiz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sankarasubramaniam</surname>
          </string-name>
          and E. Cayirci, “
          <article-title>Wireless sensor networks: a survey.,” Computer networks</article-title>
          , vol.
          <volume>38</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>393</fpage>
          -
          <lpage>422</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bandyopadhyay</surname>
          </string-name>
          and
          <string-name>
            <given-names>E. J.</given-names>
            <surname>Coyle</surname>
          </string-name>
          , “
          <article-title>An energy efficient hierarchical clustering algorithm for wireless sensor networks</article-title>
          .,
          <source>” IEEE INFOCOM</source>
          , vol. vol.
          <volume>3</volume>
          , pp.
          <fpage>1713</fpage>
          -
          <lpage>1723</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Moh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Lee</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Youn</surname>
          </string-name>
          , “
          <article-title>Energy efficient and robust multicast protocol for mobile ad hoc networks</article-title>
          ,
          <source>” Pacific Rim International Symposium on Dependable Computing</source>
          , pp.
          <fpage>145</fpage>
          -
          <lpage>152</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Masood</surname>
          </string-name>
          , “
          <article-title>Survey on Energy-Efficient Techniques for Wireless Sensor Networks</article-title>
          .,” arXiv preprint arXiv:
          <volume>2105</volume>
          .10413, no.
          <issue>1</issue>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>G. J.</given-names>
            <surname>Pottie</surname>
          </string-name>
          and
          <string-name>
            <given-names>W. J.</given-names>
            <surname>Kaiser</surname>
          </string-name>
          , “
          <article-title>Wireless integrated network sensors,” Communications of the ACM</article-title>
          , vol.
          <volume>5</volume>
          , pp.
          <fpage>51</fpage>
          -
          <lpage>58</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>C.</given-names>
            <surname>Schurghers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Raghunathan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Park</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Srivastava</surname>
          </string-name>
          , “
          <article-title>Energy-aware wireless microsensor networks</article-title>
          ,
          <source>” IEEE Signal Processing Magazine</source>
          , vol.
          <volume>2</volume>
          , pp.
          <fpage>40</fpage>
          -
          <lpage>50</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kokilavani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. S.</given-names>
            <surname>Kumar</surname>
          </string-name>
          and
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Narmadha</surname>
          </string-name>
          , “
          <article-title>Study and Analysis of Energy Efficient Data Aggregation Techniques for Wireless Sensor Networks</article-title>
          ,
          <source>” IEEE International Conference on Data Science and Information System (ICDSIS)</source>
          , Hassan, India, pp.
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S. S. G</given-names>
            and
            <surname>D. S. M. Sundaram</surname>
          </string-name>
          , “
          <source>Data Aggregation Techniques Over Wireless International Journal of Engineering Research &amp; Technology (IJERT)</source>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>L. A.</given-names>
            <surname>Fitriya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. W.</given-names>
            <surname>Purboyo</surname>
          </string-name>
          and
          <string-name>
            <given-names>A. L.</given-names>
            <surname>Prasasti</surname>
          </string-name>
          , “
          <article-title>A Review of Data Compression Techniques</article-title>
          ,”
          <source>International Journal of Applied Engineering Research ISSN</source>
          , vol.
          <volume>12</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>8956</fpage>
          -
          <lpage>8963</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Preethi</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramakrishnan</surname>
          </string-name>
          , “
          <article-title>A Survey on Data Compression Techniques in Wireless Sensor Network</article-title>
          ,”
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>T.</given-names>
            <surname>Sheltami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Musaddiq</surname>
          </string-name>
          and
          <string-name>
            <surname>E. Shakshuki,</surname>
          </string-name>
          “
          <article-title>Data compression techniques in Wireless Sensor Networks,” Future Generation Computer Systems</article-title>
          , vol.
          <volume>64</volume>
          , pp.
          <fpage>151</fpage>
          -
          <lpage>162</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [13]
          <string-name>
            <surname>K. L. Ketshabetswe</surname>
            ,
            <given-names>A. M.</given-names>
          </string-name>
          <string-name>
            <surname>Zungeru</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Mtengi</surname>
            ,
            <given-names>C. K.</given-names>
          </string-name>
          <string-name>
            <surname>Lebekwe</surname>
            and
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Prabaharan</surname>
          </string-name>
          , “
          <article-title>Data Compression Algorithms for Wireless Sensor Networks: A Review and</article-title>
          Comparison,” IEEE Access, vol.
          <volume>9</volume>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>F. F.</given-names>
            <surname>JURADO-LASSO</surname>
          </string-name>
          ,
          <string-name>
            <surname>L. MARCHEGIANI</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. F.</given-names>
            <surname>JURADO</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. M. ABU-MAHFOUZ</surname>
            and
            <given-names>X. FAFOUTIS</given-names>
          </string-name>
          , “
          <source>A Survey on Machine Learning Software-Defined,” IEE Access</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>R.</given-names>
            <surname>Rajagopalan</surname>
          </string-name>
          and
          <string-name>
            <given-names>P. K.</given-names>
            <surname>Varshney</surname>
          </string-name>
          , “
          <article-title>Data-aggregation techniques in sensor networks: A survey,”</article-title>
          <source>IEEE Communications Surveys &amp; Tutorials</source>
          , vol.
          <volume>8</volume>
          , pp.
          <fpage>48</fpage>
          -
          <lpage>63</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>S.</given-names>
            <surname>Famila</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jawahar</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Vimalraj</surname>
          </string-name>
          , “
          <article-title>Integrated Energy and Trust-Based Semi-Markov Prediction for Lifetime Maximization in Wireless Sensor Networks</article-title>
          ,”
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>J.</given-names>
            <surname>Fattah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Latifa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Aman</surname>
          </string-name>
          and
          <string-name>
            <given-names>H. E.</given-names>
            <surname>Mousaami</surname>
          </string-name>
          , “
          <article-title>Forecasting of demand using ARIMA model</article-title>
          ,”
          <source>International Journal of Engineering Business Management</source>
          , vol.
          <volume>1</volume>
          , p.
          <fpage>5</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ziqiao</surname>
          </string-name>
          , M. S. T.,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wencen</surname>
          </string-name>
          and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Fumin</surname>
          </string-name>
          , “
          <article-title>Distributed cooperative Kalman filter constrained by advection-diffusion equation for mobile sensor networks</article-title>
          ,
          <source>” Frontiers in Robotics and AI</source>
          , vol.
          <volume>10</volume>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>A.</given-names>
            <surname>Mehta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. K.</given-names>
            <surname>Sandhu</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Sapra</surname>
          </string-name>
          , “
          <article-title>Machine Learning in Wireless Sensor Networks: A Retrospective,”</article-title>
          <source>Sixth International Conference on Parallel, Distributed and Grid Computing (PDGC)</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [20]
          <string-name>
            <surname>M. A. M. Vieira</surname>
            ,
            <given-names>C. N.</given-names>
          </string-name>
          <string-name>
            <surname>Coelho</surname>
            ,
            <given-names>D. C. Da</given-names>
          </string-name>
          <string-name>
            <surname>Silva</surname>
            and
            <given-names>J. M.</given-names>
          </string-name>
          <article-title>da Mata, “Survey on wireless sensor network devices</article-title>
          .,
          <source>” EFTA</source>
          , vol.
          <volume>1</volume>
          , pp.
          <fpage>537</fpage>
          -
          <lpage>544</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>N.</given-names>
            <surname>Kimura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Jolly</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Latifi</surname>
          </string-name>
          , “
          <article-title>Energy restrained data dissemination in wireless sensor networks</article-title>
          ,”
          <source>International Journal of Distributed Sensor Networks</source>
          , pp.
          <fpage>251</fpage>
          -
          <lpage>265</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>J. Corchado</given-names>
            <surname>Rodríguez</surname>
          </string-name>
          ,
          <string-name>
            <surname>B. P. J. M.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. I. Tapia Martínez and . A. P.</given-names>
            <surname>Abraham</surname>
          </string-name>
          , “
          <article-title>Using Heterogeneous Wireless Sensor Networks in a Telemonitoring System for Healthcare</article-title>
          ,”
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>