Skip to main navigation Skip to search Skip to main content

Routing and data compression in sensor networks: Stochastic models for sensor data that guarantee scalability

  • Anna Scaglione

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

An attempt was made to determine, under plausible models for the sensor, what is the order of the number of bits generated by the entire network as a function of the number of nodes N. It was shown that there are cases where high density sensor networks are not only possibly but increased density can potentially be used to increase the precision of the measurements or decrease the transmission error.

Original languageEnglish (US)
Title of host publicationProceedings - 2003 IEEE International Symposium on Information Theory, ISIT 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages174
Number of pages1
ISBN (Print)0780377281
DOIs
StatePublished - 2003
Externally publishedYes
Event2003 IEEE International Symposium on Information Theory, SIT 2003 - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2003 IEEE International Symposium on Information Theory, SIT 2003
Country/TerritoryJapan
CityYokohama
Period6/29/037/4/03

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Routing and data compression in sensor networks: Stochastic models for sensor data that guarantee scalability'. Together they form a unique fingerprint.

Cite this