PERFORMANCE COMPARISON OF HUFFMAN AND LEMPEL-ZIV WELCH DATA COMPRESSION FOR WIRELESS SENSOR NODE APPLICATION
Asral Bahari Jambek1 & Nor Alina Khairi1 Show affiliations
- School of Microelectronic Engineering, Universiti Malaysia Perlis, Pauh Putra Campus, Perlis, Malaysia
American Journal of Applied Sciences, Volume 11, Issue 1, pp. 119–126 · doi.org/10.3844/ajassp.2014.119.126
Abstract
Wireless Sensor Networks (WSNs) are becoming important in today’s technology in helping monitoring our surrounding environment. However, wireless sensor nodes are powered by limited energy supply. To extend the lifetime of the device, energy consumption must be reduced. Data transmission is known to consume the largest amount of energy in a sensor node. Thus, one method to reduce the energy used is by compressing the data before transmitting it. This study analyses the performance of the Huffman and Lempel-Ziv Welch (LZW) algorithms when compressing data that are commonly used in WSN. From the experimental results, the Huffman algorithm gives a better performance when compared to the LZW algorithm for this type of data. The Huffman algorithm is able to reduce the data size by 43% on average, which is four times faster than the LZW algorithm.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2014 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Jambek, A. B. & Khairi, N. A. (2014). PERFORMANCE COMPARISON OF HUFFMAN AND LEMPEL-ZIV WELCH DATA COMPRESSION FOR WIRELESS SENSOR NODE APPLICATION. American Journal of Applied Sciences, 11(1), 119–126. https://doi.org/10.3844/ajassp.2014.119.126
- Licence
- © Science Publications
- Issue
- Volume 11, Issue 1
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
