Open AccessHuffman coding packet balancer based data compression techniques in Wireless Sensor Network
Author(s) -
V. Preethi Rao,
Sandeep Nukala,
G. Abirami,
R Deepa,
Revathi Venkataraman
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i2.24.12152
Subject(s) - computer science , huffman coding , computer network , wireless sensor network , end to end delay , packet loss , network packet , transmission delay , real time computing , sensor node , processing delay , key distribution in wireless sensor networks , data compression , wireless , wireless network , algorithm , telecommunications
In Wireless Sensor Networks, sensor devices perform sensing and communicating task over a network for data delivery from source to destination. Due to the heavy loaded information, during packet transmission, sensor node will drain off its energy frequently, thus led to packet loss. The novelty of the proposed work is mainly reducing the loss of packet and energy consumption during transmission. Thus, Huffman coding packet balancer select the best path between the intermediate nodes and are compared based on transmitting power, receiving and sensing power these measure the QOS in wireless sensor network. To satisfy the QOS of the node, compressed packet from source to destination is done by choosing the best intermediate node path. The advantages of the proposed work is minimum packet loss and minimize the end to end delay. Sparse recovery is used to reconstruct the path selection when there is high density of node.