DATA COMPRESSION TECHNIQUE USING HUFFMAN CODE FOR WIRELESS SENSOR NETWORK

A novel compression algorithm based on the principle of Adaptive Huffman Code is proposed in the paper to reduce the number of bits required to transmit the data of particular information. The goal of data compression is to eliminate the redundancy in a data in order to reduce its size. Data compression can either be lossless or lossy. Lossless data compression recreates the exact original data from the compressed data while lossy data compression cannot regenerate the perfect original data from the compressed data. The relevance and importance of data compression has shown a growing trend from the past few years and is expected to continue remaining the same in the coming time. The proposed will provide an overview of popular adaptive data compression methods of general utility. It evaluated these existing algorithms with a newly proposed scheme with improvements to make the algorithm fully complete.