Energy-efficient data acquisition using a distributed and self-organizing scheduling algorithm for wireless sensor networks

Authors:
Supriyo Chatterjea;Tim Nieberg;Yang Zhang;Paul Havinga
Affiliations:
Department of Computer Science, University of Twente, Enschede, The Netherlands;Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany;Department of Computer Science, University of Twente, Enschede, The Netherlands;Department of Computer Science, University of Twente, Enschede, The Netherlands
Venue:
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Year:
2007

Citing 7
Cited 3

Self-stabilization

Self-stabilization
Spatio-temporal correlation: theory and applications for wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
Approximate Data Collection in Sensor Networks using Probabilistic Models

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
An energy-efficient querying framework in sensor networks for detecting node similarities

Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
An Energy-Efficient Data Collection Framework for Wireless Sensor Networks by Exploiting Spatiotemporal Correlation

IEEE Transactions on Parallel and Distributed Systems
PAQ: time series forecasting for approximate query answering in sensor networks

EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications

A distributed and self-organizing scheduling algorithm for energy-efficient data aggregation in wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
Building (1-ε) dominating sets partition as backbones in wireless sensor networks using distributed graph coloring

DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Constructing efficient rotating backbones in wireless sensor networks using graph coloring

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor networks are often densely deployed for environmental monitoring applications. Collecting raw data from these networks can lead to excessive energy consumption. Thus using the spatial and temporal correlations that exist between adjacent nodes we appoint a few as representative nodes that perform in-network aggregation. This reduces the total number of transmissions. Our distributed scheduling algorithm autonomously assigns a particular node to perform aggregation and reassigns schedules when network topology changes. These topology changes are detected using cross-layer information from the underlying MAC layer. We also present theoretical performance estimates and upper bounds of our algorithm and evaluate it by implementing the algorithm on actual sensor nodes, demonstrating an energy-saving of up to 80% compared to raw data collection.