The Hitchhiker's guide to choosing the compression algorithm for your smart meter data
- 1 September 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 935-940
Abstract
Smart meters are increasingly penetrating the market, resulting in enormous data volumes to be communicated. In many cases, embedded devices collect the metering data and transmit them wirelessly to achieve cheap and facile deployment. Bandwidth is yet scarce and transmission occupies the spectrum. Smart meter data should hence be compressed prior to transmission. Here, solutions for personal computers are not applicable, as they are too resource-demanding. In this paper, we propose four lossless compression algorithms for smart meters. We analyze processing time and compression gains and compare the results with five off-the-shelf compression algorithms. We show that excellent compression gains can be achieved when investing a moderate amount of memory. A discussion of the suitability of the algorithms for different kinds of metering data is presented.Keywords
This publication has 13 references indexed in Scilit:
- Handbook of Data Compression2010
- Trimming the Tree: Tailoring Adaptive Huffman Coding to Wireless Sensor Networks2010
- Efficient Sensor Network Reprogramming through Compression of Executable Modules2008
- Data compression algorithms for energy-constrained devices in delay tolerant networks2006
- Lightweight temporal compression of microclimate datasets [wireless sensor networks]2004
- Energy aware lossless data compression2003
- Residential energy monitoring and computerized surveillance via utility power flowsIEEE Technology and Society Magazine, 1989
- Design and analysis of dynamic Huffman codesJournal of the ACM, 1987
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952