An adaptive Huffman algorithm for data compression in wireless sensor networks

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.