A new compression technique in MANET: compressed-LZW algorithm

Saad, Hadeel Noori; Jafar, Fairouz mushtaq; Salman, Hanan Abbas

doi:10.11591/ijeecs.v16.i2.pp890-896

Cited by 6 publications

(7 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The simple LZW algorithm only replaces the character string with a single code. Data compression with algorithm LZW starts from reading the sequence of symbols, then grouping the symbols into strings, and in the end converting the string to code [16]. During the compression process, variables; CHAR and STR are used.…”

Section: Lempel Ziv Welch Algorithmmentioning

confidence: 99%

Comparison of Huffman Algorithm and Lempel Ziv Welch Algorithm in Text File Compression

Fauzan

Alif²,

Prianto3³

2022

ITJRD

View full text Add to dashboard Cite

The development of data storage hardware is very rapidly over time. In line with the development of storage hardware, the amount of digital data shared on the internet is increasing every day. That way no matter how big the size of the storage device we have, of course, it will only be a matter of time until that storage space is exhausted. Therefore, in terms of maximizing storage space, a technique called compression emerged. This study focuses on a comparative analysis of 2 Lossless compression technique algorithms, namely the Huffman algorithm and Lempel Ziv Welch (LZW). A number of test files with different file types are applied to both algorithms that are compared. The performance of the algorithm is determined based on the comparison of space saving and compression time. The test results showed that the Lempel Ziv Welch (LZW) algorithm was superior to Huffman’s algorithm in .txt file type compression and .csv, the average space savings produced were 63.85% and 77.56%. The degree of compression speed that each algorithm produces is directly proportional to the file size.

show abstract

Section: Lempel Ziv Welch Algorithmmentioning

confidence: 99%

Comparison of Huffman Algorithm and Lempel Ziv Welch Algorithm in Text File Compression

Fauzan

Alif²,

Prianto3³

2022

ITJRD

View full text Add to dashboard Cite

show abstract

“…However, this method also does not take into account the interdependence of characters. Therefore, in data transmission systems, it is more expedient to use simpler compression methods [3].…”

Section: Comparative Compression Techniquesmentioning

confidence: 99%

“…Recently, due to the extremely rapid increase in the amount of information transmitted, computer networksare overloaded due to the low bandwidth of existing communication channels. This problem can be solved in two ways: by replacing existing communication lines with new ones with greater bandwidth, or by introducing new methods of data compression [1][2][3][4][5][6][7]. The first method requires significant financial costs, in addition, it is not always possible to replace communication lines; more often it is more advisable to use existing lines for data transmission than to lay new ones.…”

Section: Introductionmentioning

confidence: 99%

Increasing the efficiency of information transmission in communication channels

Zhurakovskyi

Boiko

Druzhynin

et al. 2020

IJEECS

View full text Add to dashboard Cite

<span lang="EN-US">This paper discusses compression methods focused on data transmission over communication channels. The characteristics of different algorithms for different types of incoming data are analyzed. The purpose of this study is to evaluate the speed of operation of each of the compression algorithms for different types of information and different compression parameters, on the basis of the obtained results to make recommendations for the application of compression methods in systems critical to the performance of the algorithm. Based on the results of the analysis, the methods of compression that can be used in communication channels are selected: LZW, LZH, Vitter and matrix. The practical research of the selected methods on different information flows (text, graphics, measurement data, combined data) was carried out, their comparative analysis was performed. Research has highlighted compression methods that give the most optimal results in each case. Comparative evaluation of algorithms for different parameters is made, the possibility of data compression implementation in systems running in real time is analyzed. Based on the results of the study, recommendations are made for the application of particular compression methods in specific conditions.</span>

show abstract

“…Subsequently node's topology modifies considerably which gives routing very challenging. Correspondingly, low bandwidth with a restricted battery ability and error expanded medium enhances more complexity in the well-organized routing protocols designing [7,8].…”

Section: Introductionmentioning

confidence: 99%

Total energy consumption analysis in wireless mobile ad hoc network with varying mobile nodes

Saad

Lafta

Al-Azzawi

et al. 2020

IJEECS

View full text Add to dashboard Cite

The energy protocols that have a mechanisms of shortest path routing considered predominant in the networking scenarios. The interesting matter in the routing protocols designing deal with mobile ad hoc network (MANET) must have an energy efficient network for better network performances. The Performances of such routing protocols that can be assessed will be focused on many metrics like delay, throughput, and packet delivery. MANET is a distribution network, having no infrastructure and network decentralization. There routing protocols are utilized for detecting paths among mobile nodes to simplify network communication. The performance comparison of three protocols are Optimized Link State Routing (OLSR), the second is Ad hoc On-Demand Distance Vector (AODV), while the third is Dynamic Source Routing (DSR) routing protocols concerning to average energy consumption and mobile node numbers are described thoroughly by NS-3 simulator. The nodes number is changing between 10 and 25 nodes, with various mobility models. The performance analysis shows that the suggested protocols are superior in relations to the energy consumption for networking data transmission and the performance of the wireless network can be improved greatly.

show abstract

A new compression technique in MANET: compressed-LZW algorithm

Cited by 6 publications

References 17 publications

Comparison of Huffman Algorithm and Lempel Ziv Welch Algorithm in Text File Compression

Comparison of Huffman Algorithm and Lempel Ziv Welch Algorithm in Text File Compression

Increasing the efficiency of information transmission in communication channels

Total energy consumption analysis in wireless mobile ad hoc network with varying mobile nodes

Contact Info

Product

Resources

About