z-logo
open-access-imgOpen Access
Lightweight Data Compression in Wireless Sensor Networks Using Huffman Coding
Author(s) -
Henry Medeiros,
Marcos Costa Maciel,
Richard Demo Souza,
Marcelo Eduardo Pellenz
Publication year - 2014
Publication title -
international journal of distributed sensor networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 53
eISSN - 1550-1477
pISSN - 1550-1329
DOI - 10.1155/2014/672921
Subject(s) - huffman coding , computer science , wireless sensor network , data compression , entropy encoding , entropy (arrow of time) , coding (social sciences) , wireless , real time computing , data mining , lossless compression , algorithm , computer network , telecommunications , statistics , physics , mathematics , quantum mechanics
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom