By Topic

Huffman and Lempel-Ziv based data compression algorithms for 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

2 Author(s)
Renugadevi, S. ; Sch. of Electron. Eng., VIT Univ., Vellore, India ; Nithya Darisini, P.S.

In the recent years, wireless sensor networks have gained increasing attention from both the research community and actual users. As sensor nodes are generally battery powered devices, it is essential to minimize the energy consumption of the nodes so that the network lifetime can be extended. Most of the energy is consumed in the processing and transmission of data. Applying compression algorithms on the wireless sensor data prior to transmission is one of the efficient ways to save energy. In this paper we propose data compression algorithms based on Huffman and Lempel-Ziv techniques and compare the efficiency of different algorithms in a wireless sensor network scenario.

Published in:

Pattern Recognition, Informatics and Mobile Engineering (PRIME), 2013 International Conference on

Date of Conference:

21-22 Feb. 2013