By Topic

An adaptive Huffman algorithm for data compression in wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sacaleanu, D.I. ; Fac. of Electron., Univ. Politeh., Bucharest, Romania ; Stoian, R. ; Ofrim, D.M.

The major problem in wireless sensor networks (WSN) is the limited energy supply. As the transmission of the data is the largest energy consumption, many studies have turned attention on reducing the amount of bits transmitted. The solution consists in data compression. This article presents a dynamic algorithm based on an adaptive dictionary. The algorithm exploits the temporal data correlation and the Huffman compression. Experiments made underlie its efficiency in highly correlated data.

Published in:

Signals, Circuits and Systems (ISSCS), 2011 10th International Symposium on

Date of Conference:

June 30 2011-July 1 2011