On the interdependence of routing and data compression in multi-hop sensor networks

Anna Scaglione, Sergio Servetto

Research output: Contribution to journalArticle

50 Citations (Scopus)

Abstract

We consider a problem of broadcast communication in sensor networks, in which samples of a random field are collected at each node, and the goal is for all nodes to obtain an estimate of the entire field within a prescribed distortion value. The main idea we explore in this paper is that of jointly compressing the data generated by different nodes as this information travels over multiple hops, to eliminate correlations in the representation of the sampled field. Our main contributions are: (a) we obtain, using simple network flow concepts, conditions on the rate/distortion function of the random field, so as to guarantee that any node can obtain the measurements collected at every other node in the network, quantized to within any prescribed distortion value; and (b) we construct a large class of physically-motivated stochastic models for sensor data, for which we are able to prove that the joint rate/distortion function of all the data generated by the whole network grows slower than the bounds found in (a). A truly novel aspect of our work is the tight coupling between routing and source coding, explicitly formulated in a simple and analytically tractable model - to the best of our knowledge, this connection had not been studied before.

Original languageEnglish (US)
Pages (from-to)149-160
Number of pages12
JournalWireless Networks
Volume11
Issue number1-2
DOIs
StatePublished - Jan 2005
Externally publishedYes

Fingerprint

Data compression
Sensor networks
Stochastic models
Communication
Sensors

Keywords

  • Cross-layer interactions
  • Multi-hop sensor networks
  • Routing
  • Source coding

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Electrical and Electronic Engineering

Cite this

On the interdependence of routing and data compression in multi-hop sensor networks. / Scaglione, Anna; Servetto, Sergio.

In: Wireless Networks, Vol. 11, No. 1-2, 01.2005, p. 149-160.

Research output: Contribution to journalArticle

@article{cf837f77678c41ad9064ab917fd5e475,
title = "On the interdependence of routing and data compression in multi-hop sensor networks",
abstract = "We consider a problem of broadcast communication in sensor networks, in which samples of a random field are collected at each node, and the goal is for all nodes to obtain an estimate of the entire field within a prescribed distortion value. The main idea we explore in this paper is that of jointly compressing the data generated by different nodes as this information travels over multiple hops, to eliminate correlations in the representation of the sampled field. Our main contributions are: (a) we obtain, using simple network flow concepts, conditions on the rate/distortion function of the random field, so as to guarantee that any node can obtain the measurements collected at every other node in the network, quantized to within any prescribed distortion value; and (b) we construct a large class of physically-motivated stochastic models for sensor data, for which we are able to prove that the joint rate/distortion function of all the data generated by the whole network grows slower than the bounds found in (a). A truly novel aspect of our work is the tight coupling between routing and source coding, explicitly formulated in a simple and analytically tractable model - to the best of our knowledge, this connection had not been studied before.",
keywords = "Cross-layer interactions, Multi-hop sensor networks, Routing, Source coding",
author = "Anna Scaglione and Sergio Servetto",
year = "2005",
month = "1",
doi = "10.1007/s11276-004-4752-y",
language = "English (US)",
volume = "11",
pages = "149--160",
journal = "Wireless Networks",
issn = "1022-0038",
publisher = "Springer Netherlands",
number = "1-2",

}

TY - JOUR

T1 - On the interdependence of routing and data compression in multi-hop sensor networks

AU - Scaglione, Anna

AU - Servetto, Sergio

PY - 2005/1

Y1 - 2005/1

N2 - We consider a problem of broadcast communication in sensor networks, in which samples of a random field are collected at each node, and the goal is for all nodes to obtain an estimate of the entire field within a prescribed distortion value. The main idea we explore in this paper is that of jointly compressing the data generated by different nodes as this information travels over multiple hops, to eliminate correlations in the representation of the sampled field. Our main contributions are: (a) we obtain, using simple network flow concepts, conditions on the rate/distortion function of the random field, so as to guarantee that any node can obtain the measurements collected at every other node in the network, quantized to within any prescribed distortion value; and (b) we construct a large class of physically-motivated stochastic models for sensor data, for which we are able to prove that the joint rate/distortion function of all the data generated by the whole network grows slower than the bounds found in (a). A truly novel aspect of our work is the tight coupling between routing and source coding, explicitly formulated in a simple and analytically tractable model - to the best of our knowledge, this connection had not been studied before.

AB - We consider a problem of broadcast communication in sensor networks, in which samples of a random field are collected at each node, and the goal is for all nodes to obtain an estimate of the entire field within a prescribed distortion value. The main idea we explore in this paper is that of jointly compressing the data generated by different nodes as this information travels over multiple hops, to eliminate correlations in the representation of the sampled field. Our main contributions are: (a) we obtain, using simple network flow concepts, conditions on the rate/distortion function of the random field, so as to guarantee that any node can obtain the measurements collected at every other node in the network, quantized to within any prescribed distortion value; and (b) we construct a large class of physically-motivated stochastic models for sensor data, for which we are able to prove that the joint rate/distortion function of all the data generated by the whole network grows slower than the bounds found in (a). A truly novel aspect of our work is the tight coupling between routing and source coding, explicitly formulated in a simple and analytically tractable model - to the best of our knowledge, this connection had not been studied before.

KW - Cross-layer interactions

KW - Multi-hop sensor networks

KW - Routing

KW - Source coding

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

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

U2 - 10.1007/s11276-004-4752-y

DO - 10.1007/s11276-004-4752-y

M3 - Article

AN - SCOPUS:17444401760

VL - 11

SP - 149

EP - 160

JO - Wireless Networks

JF - Wireless Networks

SN - 1022-0038

IS - 1-2

ER -