A Huffman based lossless compression algorithm for wireless sensor networks

Mehfuz, Shabana; Tiwari, Usha; Rathore, Akanksha; Arora, Ankit; Singh, Diksha

doi:10.1109/cipech.2014.7019076

Cited by 1 publication

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The reader can get more information about the Huffman coding algorithm in the work of Mehfuz et al 32 In each round, different CHs are chosen in all clusters to facilitate load distribution until every node depletes within the sensing area.…”

Section: Design Flow Of Lcdgramentioning

confidence: 99%

A lifetime-enhancing cooperative data gathering and relaying algorithm for cluster-based wireless sensor networks

Agbulu

Kumar

Juliet

2020

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Despite unique energy-saving dispositions of cluster-based routing protocols, clustered wireless sensor networks with static sinks typically have problems of unbalanced energy consumptions, as the cluster head nodes around the sink are typically loaded with traffic from upper levels of clusters. This results in reduced lifetimes of the nodes and deterioration of other crucial performances. Meanwhile, it has been inferred from current literature that dedicated relay cooperation in cluster-based wireless sensor networks guarantees longer lifetime of the nodes and more improved performance. Therefore, to attain further enhanced performance among the current schemes, a lifetime-enhancing cooperative data gathering and relaying algorithm for cluster-based wireless sensor networks is proposed in this article. The proposed lifetime-enhancing cooperative data gathering and relaying algorithm shares the nodes into clusters using a hybrid K-means clustering algorithm that combines K-means clustering and Huffman coding algorithms. It makes full use of dedicated relay cooperative multi-hop communication with network coding mechanisms to achieve reduced data propagation cost from the various cluster sections to the central base station. The relay node selection is framed as a NP-hard problem, with regard to communication distances and residual energy metrics. Furthermore, to resolve the problem, a gradient descent algorithm is proposed. Simulation results endorse the proposed scheme to outperform related schemes in terms of latency, lifetime, and energy consumption and delivery rates.

show abstract

Section: Design Flow Of Lcdgramentioning

confidence: 99%