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

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 174-

  Scaglione, Anna ^a  

^a Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; MATHEMATICAL MODELS; RANDOM PROCESSES; ROUTERS; SENSOR DATA FUSION; WIRELESS TELECOMMUNICATION SYSTEMS;

SENSOR NETWORKS; STOCHASTIC MODELS;

INFORMATION THEORY;

EID: 0141904594     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228188     Document Type: Conference Paper

References (5)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network Information Flow. IEEE Trans. Inform. Theory, 46(4):1204-1216, 2000.
2. P. Gupta and P. R. Kumar, The Capacity of Wireless Networks. IEEE Trans. Inform. Theory, 46(2):388-404, 2000.
3. S. S. Pradhan and K. Ramchandran. Distributed Source Coding: Symmetric Rates and Applications to Sensor Networks. In Proc. IEEE Data Compression Conf. (DCC), Snowbird, UT, 2000.
4. S. D. Servetto. Lattice Quantization with Side Information. In Proc. IEEE Data Compression Conf. (DCC), Snowbird, UT, 2000. An extended journal version, with title Quantization with Side Information: Lattice Codes, Asymptotics, and Applications in Wireless Networks, has been submitted for publication, and is available from http://people.ece.cornell.edu/servetto/.
5. Q. Zhao and M. Effros. Optimal Code Design for Lossless and Near Lossless Source Coding in Multiple Access Networks. In Proc. Data Compression Conf. (DCC), Snowbird, UT, 2001.