A Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Aggregation in Wireless Sensor Networks

Supriyo Chatterjea, T. Nieberg, Nirvana Meratnia, Paul J.M. Havinga

Research output: Book/ReportReportProfessional

43 Downloads (Pure)

Abstract

Wireless sensor networks (WSNs) are increasingly being used to monitor various parameters in a wide range of environmental monitoring applications. In many instances, environmental scientists are interested in collecting raw data using long-running queries injected into a WSN for analyzing at a later stage rather than injecting snap-shot queries into the network that contain data-reducing operators (e.g. MIN, MAX, AVG) that aggregate data. Collection of raw data poses a challenge to WSNs as very large amounts of data need to be transported through the network. This not only leads to high levels of energy consumption and thus diminished network lifetime but also results in poor data quality as much of the data may be lost due to the limited bandwidth of present-day sensor nodes. We alleviate this problem by allowing certain nodes in the network to aggregate data by taking advantage of spatial and temporal correlations of various physical parameters and thus eliminating the transmission of redundant data. In this paper we present a distributed scheduling algorithm that decides when a particular node should perform this novel type of aggregation. The scheduling algorithm autonomously reassigns schedules when changes in network topology due to failing or newly added nodes, are detected. Such changes in topology are detected using cross-layer information from the underlying MAC layer. We present theoretical performance bounds of our algorithm and include simulation results which indicate energy savings of up to 80\% when compared to collecting raw data.
Original languageUndefined
Place of PublicationEnschede
PublisherCentre for Telematics and Information Technology (CTIT)
Number of pages42
Publication statusPublished - Feb 2007

Publication series

NameCTIT Technical Report Series
PublisherUniversity of Twente, Centre for Telematics and Information Technology (CTIT)
No.TR-CTIT-07-10
ISSN (Print)1381-3625

Keywords

  • EWI-9354
  • IR-59883
  • METIS-242159
  • CAES-PS: Pervasive Systems

Cite this

Chatterjea, S., Nieberg, T., Meratnia, N., & Havinga, P. J. M. (2007). A Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Aggregation in Wireless Sensor Networks. (CTIT Technical Report Series; No. TR-CTIT-07-10). Enschede: Centre for Telematics and Information Technology (CTIT).
Chatterjea, Supriyo ; Nieberg, T. ; Meratnia, Nirvana ; Havinga, Paul J.M. / A Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Aggregation in Wireless Sensor Networks. Enschede : Centre for Telematics and Information Technology (CTIT), 2007. 42 p. (CTIT Technical Report Series; TR-CTIT-07-10).
@book{f0a9a314b72f45cb914b43e1f39bafb3,
title = "A Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Aggregation in Wireless Sensor Networks",
abstract = "Wireless sensor networks (WSNs) are increasingly being used to monitor various parameters in a wide range of environmental monitoring applications. In many instances, environmental scientists are interested in collecting raw data using long-running queries injected into a WSN for analyzing at a later stage rather than injecting snap-shot queries into the network that contain data-reducing operators (e.g. MIN, MAX, AVG) that aggregate data. Collection of raw data poses a challenge to WSNs as very large amounts of data need to be transported through the network. This not only leads to high levels of energy consumption and thus diminished network lifetime but also results in poor data quality as much of the data may be lost due to the limited bandwidth of present-day sensor nodes. We alleviate this problem by allowing certain nodes in the network to aggregate data by taking advantage of spatial and temporal correlations of various physical parameters and thus eliminating the transmission of redundant data. In this paper we present a distributed scheduling algorithm that decides when a particular node should perform this novel type of aggregation. The scheduling algorithm autonomously reassigns schedules when changes in network topology due to failing or newly added nodes, are detected. Such changes in topology are detected using cross-layer information from the underlying MAC layer. We present theoretical performance bounds of our algorithm and include simulation results which indicate energy savings of up to 80\{\%} when compared to collecting raw data.",
keywords = "EWI-9354, IR-59883, METIS-242159, CAES-PS: Pervasive Systems",
author = "Supriyo Chatterjea and T. Nieberg and Nirvana Meratnia and Havinga, {Paul J.M.}",
year = "2007",
month = "2",
language = "Undefined",
series = "CTIT Technical Report Series",
publisher = "Centre for Telematics and Information Technology (CTIT)",
number = "TR-CTIT-07-10",
address = "Netherlands",

}

Chatterjea, S, Nieberg, T, Meratnia, N & Havinga, PJM 2007, A Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Aggregation in Wireless Sensor Networks. CTIT Technical Report Series, no. TR-CTIT-07-10, Centre for Telematics and Information Technology (CTIT), Enschede.

A Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Aggregation in Wireless Sensor Networks. / Chatterjea, Supriyo; Nieberg, T.; Meratnia, Nirvana; Havinga, Paul J.M.

Enschede : Centre for Telematics and Information Technology (CTIT), 2007. 42 p. (CTIT Technical Report Series; No. TR-CTIT-07-10).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - A Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Aggregation in Wireless Sensor Networks

AU - Chatterjea, Supriyo

AU - Nieberg, T.

AU - Meratnia, Nirvana

AU - Havinga, Paul J.M.

PY - 2007/2

Y1 - 2007/2

N2 - Wireless sensor networks (WSNs) are increasingly being used to monitor various parameters in a wide range of environmental monitoring applications. In many instances, environmental scientists are interested in collecting raw data using long-running queries injected into a WSN for analyzing at a later stage rather than injecting snap-shot queries into the network that contain data-reducing operators (e.g. MIN, MAX, AVG) that aggregate data. Collection of raw data poses a challenge to WSNs as very large amounts of data need to be transported through the network. This not only leads to high levels of energy consumption and thus diminished network lifetime but also results in poor data quality as much of the data may be lost due to the limited bandwidth of present-day sensor nodes. We alleviate this problem by allowing certain nodes in the network to aggregate data by taking advantage of spatial and temporal correlations of various physical parameters and thus eliminating the transmission of redundant data. In this paper we present a distributed scheduling algorithm that decides when a particular node should perform this novel type of aggregation. The scheduling algorithm autonomously reassigns schedules when changes in network topology due to failing or newly added nodes, are detected. Such changes in topology are detected using cross-layer information from the underlying MAC layer. We present theoretical performance bounds of our algorithm and include simulation results which indicate energy savings of up to 80\% when compared to collecting raw data.

AB - Wireless sensor networks (WSNs) are increasingly being used to monitor various parameters in a wide range of environmental monitoring applications. In many instances, environmental scientists are interested in collecting raw data using long-running queries injected into a WSN for analyzing at a later stage rather than injecting snap-shot queries into the network that contain data-reducing operators (e.g. MIN, MAX, AVG) that aggregate data. Collection of raw data poses a challenge to WSNs as very large amounts of data need to be transported through the network. This not only leads to high levels of energy consumption and thus diminished network lifetime but also results in poor data quality as much of the data may be lost due to the limited bandwidth of present-day sensor nodes. We alleviate this problem by allowing certain nodes in the network to aggregate data by taking advantage of spatial and temporal correlations of various physical parameters and thus eliminating the transmission of redundant data. In this paper we present a distributed scheduling algorithm that decides when a particular node should perform this novel type of aggregation. The scheduling algorithm autonomously reassigns schedules when changes in network topology due to failing or newly added nodes, are detected. Such changes in topology are detected using cross-layer information from the underlying MAC layer. We present theoretical performance bounds of our algorithm and include simulation results which indicate energy savings of up to 80\% when compared to collecting raw data.

KW - EWI-9354

KW - IR-59883

KW - METIS-242159

KW - CAES-PS: Pervasive Systems

M3 - Report

T3 - CTIT Technical Report Series

BT - A Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Aggregation in Wireless Sensor Networks

PB - Centre for Telematics and Information Technology (CTIT)

CY - Enschede

ER -

Chatterjea S, Nieberg T, Meratnia N, Havinga PJM. A Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Aggregation in Wireless Sensor Networks. Enschede: Centre for Telematics and Information Technology (CTIT), 2007. 42 p. (CTIT Technical Report Series; TR-CTIT-07-10).