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

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

17 Scopus citations

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 publicationIEEE International Symposium on Information Theory - Proceedings
Pages174
Number of pages1
StatePublished - 2003
Externally publishedYes
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

Other

OtherProceedings 2003 IEEE International Symposium on Information Theory (ISIT)
CountryJapan
CityYokohama
Period6/29/037/4/03

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

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

    Scaglione, A. (2003). Routing and data compression in sensor networks: Stochastic models for sensor data that guarantee scalability. In IEEE International Symposium on Information Theory - Proceedings (pp. 174)