Minimizing energy consumption in large-scale sensor networks through distributed data compression and hierarchical aggregation

Seung Jun Baek, Gustavo De Veciana, Xun Su

Research output: Contribution to journalArticle

149 Citations (Scopus)

Abstract

In this paper, we study how to reduce energy consumption in large-scale sensor networks, which systematically sample a spatio-temporal field. We begin by formulating a distributed compression problem subject to aggregation (energy) costs to a single sink. We show that the optimal solution is greedy and based on ordering sensors according to their aggregation costs - typically related to proximity - and, perhaps surprisingly, it is independent of the distribution of data sources. Next, we consider a simplified hierarchical model for a sensor network including multiple sinks, compressors/aggregation nodes, and sensors. Using a reasonable metric for energy cost, we show that the optimal organization of devices is associated with a Johnson-Mehl tessellation induced by their locations. Drawing on techniques from stochastic geometry, we analyze the energy savings that optimal hierarchies provide relative to previously proposed organizations based on proximity, i.e., associated Voronoi tessellations. Our analysis and simulations show that an optimal organization of aggregation/compression can yield 8%-28% energy savings depending on the compression ratio.

Original languageEnglish
Pages (from-to)1130-1140
Number of pages11
JournalIEEE Journal on Selected Areas in Communications
Volume22
Issue number6
DOIs
Publication statusPublished - 2004 Aug 1
Externally publishedYes

Fingerprint

Data compression
Sensor networks
Energy utilization
Agglomeration
Energy conservation
Costs
Sensors
Compressors
Geometry

Keywords

  • Data aggregation
  • Distributed data compression
  • Sensor networks
  • Stochastic geometry

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Minimizing energy consumption in large-scale sensor networks through distributed data compression and hierarchical aggregation. / Baek, Seung Jun; De Veciana, Gustavo; Su, Xun.

In: IEEE Journal on Selected Areas in Communications, Vol. 22, No. 6, 01.08.2004, p. 1130-1140.

Research output: Contribution to journalArticle

@article{134ebab8fdac4c0c95184ad5e1b71d19,
title = "Minimizing energy consumption in large-scale sensor networks through distributed data compression and hierarchical aggregation",
abstract = "In this paper, we study how to reduce energy consumption in large-scale sensor networks, which systematically sample a spatio-temporal field. We begin by formulating a distributed compression problem subject to aggregation (energy) costs to a single sink. We show that the optimal solution is greedy and based on ordering sensors according to their aggregation costs - typically related to proximity - and, perhaps surprisingly, it is independent of the distribution of data sources. Next, we consider a simplified hierarchical model for a sensor network including multiple sinks, compressors/aggregation nodes, and sensors. Using a reasonable metric for energy cost, we show that the optimal organization of devices is associated with a Johnson-Mehl tessellation induced by their locations. Drawing on techniques from stochastic geometry, we analyze the energy savings that optimal hierarchies provide relative to previously proposed organizations based on proximity, i.e., associated Voronoi tessellations. Our analysis and simulations show that an optimal organization of aggregation/compression can yield 8{\%}-28{\%} energy savings depending on the compression ratio.",
keywords = "Data aggregation, Distributed data compression, Sensor networks, Stochastic geometry",
author = "Baek, {Seung Jun} and {De Veciana}, Gustavo and Xun Su",
year = "2004",
month = "8",
day = "1",
doi = "10.1109/JSAC.2004.830934",
language = "English",
volume = "22",
pages = "1130--1140",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Minimizing energy consumption in large-scale sensor networks through distributed data compression and hierarchical aggregation

AU - Baek, Seung Jun

AU - De Veciana, Gustavo

AU - Su, Xun

PY - 2004/8/1

Y1 - 2004/8/1

N2 - In this paper, we study how to reduce energy consumption in large-scale sensor networks, which systematically sample a spatio-temporal field. We begin by formulating a distributed compression problem subject to aggregation (energy) costs to a single sink. We show that the optimal solution is greedy and based on ordering sensors according to their aggregation costs - typically related to proximity - and, perhaps surprisingly, it is independent of the distribution of data sources. Next, we consider a simplified hierarchical model for a sensor network including multiple sinks, compressors/aggregation nodes, and sensors. Using a reasonable metric for energy cost, we show that the optimal organization of devices is associated with a Johnson-Mehl tessellation induced by their locations. Drawing on techniques from stochastic geometry, we analyze the energy savings that optimal hierarchies provide relative to previously proposed organizations based on proximity, i.e., associated Voronoi tessellations. Our analysis and simulations show that an optimal organization of aggregation/compression can yield 8%-28% energy savings depending on the compression ratio.

AB - In this paper, we study how to reduce energy consumption in large-scale sensor networks, which systematically sample a spatio-temporal field. We begin by formulating a distributed compression problem subject to aggregation (energy) costs to a single sink. We show that the optimal solution is greedy and based on ordering sensors according to their aggregation costs - typically related to proximity - and, perhaps surprisingly, it is independent of the distribution of data sources. Next, we consider a simplified hierarchical model for a sensor network including multiple sinks, compressors/aggregation nodes, and sensors. Using a reasonable metric for energy cost, we show that the optimal organization of devices is associated with a Johnson-Mehl tessellation induced by their locations. Drawing on techniques from stochastic geometry, we analyze the energy savings that optimal hierarchies provide relative to previously proposed organizations based on proximity, i.e., associated Voronoi tessellations. Our analysis and simulations show that an optimal organization of aggregation/compression can yield 8%-28% energy savings depending on the compression ratio.

KW - Data aggregation

KW - Distributed data compression

KW - Sensor networks

KW - Stochastic geometry

UR - http://www.scopus.com/inward/record.url?scp=4344582402&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4344582402&partnerID=8YFLogxK

U2 - 10.1109/JSAC.2004.830934

DO - 10.1109/JSAC.2004.830934

M3 - Article

AN - SCOPUS:4344582402

VL - 22

SP - 1130

EP - 1140

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 6

ER -