An Energy-aware Iterative Sampling Framework for Data Gathering in Wireless Sensor Networks

Jun Wang, Zhenglu Wang, Yong Cheng, Yongsheng ZhuInternational Journal of Grid and Distributed Computing 2013 · DOI

Abstract

Large numbers of nodes are often densely deployed to deliver the desired environmental attributes to the sink in Wireless Sensor Networks (WSNs), leading to high spatial correlation among readings. Given accuracy requirements, only a subset of nodes needs to transport data. We propose an Energy-aware Iterative Sampling Framework (EISF) to reduce transmissions by exploiting this correlation. Nodes compete to report based on energy-related probability; non-reporting nodes autonomously determine redundancy via overheard packets and enter sleep mode if redundant. Simulation results using real-world data demonstrate that EISF effectively prolongs network life.

Introduction: The Challenge of Dense WSNs

Wireless Sensor Networks (WSNs) are frequently deployed in dense clusters for environmental monitoring. While density ensures coverage, it creates an "over-sampling" problem: nearby nodes often report nearly identical data (e.g., temperature or humidity). If every node transmits its data to a central sink, the limited battery life of the sensors is rapidly depleted. The challenge is to select a minimal subset of "sampling nodes" that accurately represent the environment without requiring a power-intensive central controller to manage the selection process.

Methodology: The EISF Framework

The proposed Energy-aware Iterative Sampling Framework (EISF) is a decentralized approach that operates in discrete cycles. Each cycle is divided into three primary phases: sensing, competing, and data transporting.

The three-phase cycle structure of the EISF framework.
  1. Energy-Related Competition: Instead of picking nodes at random, EISF uses a probability function where nodes with higher residual energy have a higher chance of becoming "reporting nodes." This ensures the energy burden is balanced across the network.
  2. Iterative Redundancy Check: Within a single cycle, nodes go through multiple rounds (iterations). A node overhears the transmissions of its neighbors and uses Inverse Distance Weighting (IDW) interpolation to estimate its own reading.
  3. Autonomous Sleeping: If a node determines that its neighbor's data can predict its own value within a pre-set error bound, it labels itself "redundant" and goes into sleep mode for the rest of the cycle.
  4. Sink-Side Reconstruction: The central sink receives data only from the selected sampling nodes and uses the same IDW algorithm to "fill in the blanks" for the sleeping nodes.

The framework was validated using the Intel Lab Data Set, specifically one-week temperature records from 54 nodes, simulated in Matlab.

Key Results and Discussion

The EISF framework demonstrates significant improvements over existing methods like ODSA and E2K. By prioritizing nodes with higher battery levels for reporting, the system achieves more uniform energy depletion across the network.

Comparison of residual energy across nodes for EISF, E2K, and ODSA.
  • Extended Lifespan: EISF prolonged network life (defined as the time until the first node dies) by 30% to 50% compared to benchmarks.
  • Reduced Traffic: In many cycles, EISF required only half the number of sampling nodes compared to its competitors while maintaining the same accuracy guarantees.
  • Stability: The number of sampling nodes typically stabilizes after approximately 10 iterations, providing an efficient operational "sweet spot."

Conclusion and Future Work

EISF successfully leverages spatial correlation and local overhearing to optimize energy consumption in WSNs. While effective for spatial redundancy, the current version does not fully address temporal correlation (how a node's reading relates to its own past readings). Future work will involve integrating time-series forecasting models into the framework and exploring the impact of packet loss in high-noise environments.

Summary updated

Abstract

Large numbers of nodes are often densely deployed to deliver the desired environmental attributes to the sink in Wireless Sensor Networks (WSNs), so there is a high spatial correlation among the readings of close sensor nodes. Given a certain requirement for accuracy, only part of the sensor nodes should be required to transport the data to sink. We proposed an Energy-aware Iterative Sampling Framework (EISF) for data gathering to reduce the total number of transmissions by exploiting the correlation. In our method, all nodes in a WSNs compete for reporting nodes with energy-related probability and each nonreporting node autonomously determines whether its own readings are redundant or not by utilizing the overheard packets transmitted by the nearby reporting nodes for each epoch. The redundant nodes will be put into sleep mode. After a limited number of iterations, our algorithm can select a set of sampling nodes to transport data with accuracy guarantees. The results of simulation experiments using the real data demonstrate that our proposed approach is effective in prolonging the network life.
BibTeX
@article{wang2013energy,
  author = {Jun Wang and Zhenglu Wang and Yong Cheng and Yongsheng Zhu},
  title = {{An Energy-aware Iterative Sampling Framework for Data Gathering in Wireless Sensor Networks}},
  journal = {International Journal of Grid and Distributed Computing},
  year = {2013},
  doi = {10.14257/ijgdc.2013.6.4.02},
}
Figure