Aggregating Correlated Data in Sensor Networks

Consider a network where each node gathers information from its vicinity and sends this information to a centralized processing agent. If the information is geographically correlated, then a large saving in data transmission costs may be obtained by aggregating information from nearby nodes before s...

Full description

Saved in:
Bibliographic Details
Published inCombinatorial and Algorithmic Aspects of Networking pp. 1 - 2
Main Authors Enachescu, M., Goel, A., Govindan, R., Motwani, R.
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Aggregation Tree
Battery Limitation
Central Agent
Constant Factor Approximation
Sensor Network
Online AccessGet full text

Cover

More Information
Summary:Consider a network where each node gathers information from its vicinity and sends this information to a centralized processing agent. If the information is geographically correlated, then a large saving in data transmission costs may be obtained by aggregating information from nearby nodes before sending it to the central agent. This is particularly relevant to sensor networks where battery limitations dictate that data transmission be kept to a minimum, and where sensed data is often geographically correlated. In-network aggregation for sensor networks has been extensively studied over the last few years. In this paper we show that a very simple opportunistic aggregation scheme can result in near-optimum performance under widely varying (and unknown) scales of correlation.
ISBN:9783540278733
3540278737
ISSN:0302-9743
1611-3349
DOI:10.1007/11527954_1