Online Information Compression in Sensor Networks
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7, 3371-3376
Abstract
In the emerging area of wireless sensor networks, one of the most typical challenges is to retrieve historical information from the sensor nodes. Due to the resource limitation of sensor nodes (processing, memory, bandwidth, and energy), the collected information of sensor nodes has to be compressed quickly and precisely for transmission. In this paper, we propose a new technique -- the ALVQ (Adoptive Learning Vector Quantization) algorithm to compress this historical information. The ALVQ algorithm constructs a codebook to capture the prominent features of the data and with these features all the other data can be piece-wise encoded for compression. In addition, with two-level regression of the codebook's update, ALVQ algorithm saves the data transfer bandwidth and improves the compression precision further. Finally, we consider the problem of transmitting data in a sensor network while maximizing the precision. We show how we apply our algorithm so that a set of sensors can dynamically share a wireless communication channel.Keywords
This publication has 9 references indexed in Scilit:
- TEEN: a routing protocol for enhanced efficiency in wireless sensor networks2005
- Energy-efficient communication protocol for wireless microsensor networks2005
- Compressing historical information in sensor networks2004
- Energy-aware routing in cluster-based sensor networks2003
- Evaluating probabilistic queries over imprecise data2003
- Optimal fractal coding is NP-hard2002
- Multi-Dimensional Regression Analysis of Time-Series Data Streams2002
- NiagaraCQ2000
- Improved versions of learning vector quantization1990