Lightweight Data Compression in Wireless Sensor Networks Using Huffman Coding
Citations Over TimeTop 10% of 2014 papers
Abstract
This paper presents a lightweight data compression method for wireless sensor networks monitoring environmental parameters with low resolution sensors. Instead of attempting to devise novel ad hoc algorithms, we show that, given general knowledge of the parameters that must be monitored, it is possible to efficiently employ conventional Huffman coding to represent the same parameter when measured at different locations and time periods. When the data collected by the sensor nodes consists of integer measurements, the Huffman dictionary computed using statistics inferred from public datasets often approaches the entropy of the data. Results using temperature and relative humidity measurements show that even when the proposed method does not approach the theoretical limit, it outperforms popular compression mechanisms designed specifically for wireless sensor networks.
Related Papers
- COMPARISON OF LOSSLESS DATA COMPRESSION ALGORITHMS FOR TEXT DATA(2010)
- → Study on the Real-Time Lossless Data Compression Method Used in the Readout System for Micropattern Gas Detector(2019)4 cited
- A New Lossless Method of Image Compression by Decomposing the Tree of Huffman Technique(2015)
- The Novel Lossless Text Compression Technique Using Ambigram Logic and Huffman Coding(2012)
- Lossless Data Compression in Data Acquisition System(2003)