International Journal of Wireless and Microwave Technologies (IJWMT)
IJWMT Vol. 16, No. 4, 8 Aug. 2026
Cover page and Table of Contents: PDF (size: 663KB)
Adaptive Data Compression Framework for Network Transmission Optimization Based on Entropy and Bandwidth Analysis
PDF (663KB), PP.178-196
Views: 0 Downloads: 0
Author(s)
Index Terms
Adaptive Data Compression Framework, Entropy, Compression Algorithms, LZ4, ZSTD, Brotli, Software Implementation, Real-Time Data Analysis.
Abstract
This paper addresses the problem of efficient data transmission under dynamically changing network and computational conditions by proposing an adaptive data compression method based on context-aware selection of compression algorithms and their parameters. Unlike conventional static approaches, the proposed method performs real-time analysis of data characteristics, network bandwidth, latency, and available computational resources, enabling dynamic selection of the optimal compression strategy through multi-criteria optimization. The scientific novelty of the work lies in the integration of data-driven and environment-aware adaptation within a unified decision-making framework that simultaneously minimizes end-to-end transmission delay while balancing compression ratio and processing overhead. Experimental evaluation was conducted using both synthetic datasets and the standard Silesia Corpus benchmark. The synthetic datasets included repetitive low-entropy text (repeated.txt), structured JSON data (structured.json), moderate-complexity text (example.txt), and high-entropy binary streams (random.bin), representing realistic web content and raw data transmission scenarios. The Silesia Corpus, containing approximately 200 MB of heterogeneous real-world files, including text, binaries, and images, was used for validation and benchmarking. The proposed method was evaluated using compression algorithms such as LZ4, Zstandard, Brotli, and ZSTD under different network conditions and system loads. Experimental results show that the adaptive approach reduces total transmission time by an average of 23%, improves compression efficiency by 16%, and decreases computational resource consumption by 13% compared to conventional static compression methods. The software implementation is based on a modular service-oriented architecture that supports real-time monitoring, dynamic algorithm switching, and scalable deployment in distributed, cloud, streaming, and Internet of Things environments.
Cite This Paper
Liubov Oleshchenko, Zhengbing Hu, Andrii Dychka, "Adaptive Data Compression Framework for Network Transmission Optimization Based on Entropy and Bandwidth Analysis", International Journal of Wireless and Microwave Technologies(IJWMT), Vol.16, No.4, pp. 178-196, 2026. DOI:10.5815/ijwmt.2026.04.11
Reference
[1]J. Ziv and A. Lempel, "A Universal Algorithm for Sequential Data Compression," in IEEE Transactions on Information Theory, vol. 23, no. 3, pp. 337-343, May 1977, doi: 10.1109/TIT.1977.1055714.
[2]T. Welch, "A Technique for High-Performance Data Compression," in Computer, vol. 17, no. 6, pp. 8-19, June 1984, doi: 10.1109/MC.1984.1659158.
[3]M. Burrows and D. J. Wheeler, "A Block-Sorting Lossless Data Compression Algorithm," Digital SRC Research Report, 1994.
[4]P. Deutsch, "DEFLATE Compressed Data Format Specification Version 1.3," RFC 1951, IETF, May 1996.
[5]D. Taubman and M. Marcellin, JPEG2000 Image Compression Fundamentals, Standards and Practice. New York, NY, USA: Springer, 2002, doi: 10.1007/978-1-4615-0799-4.
[6]D. Salomon and G. Motta, Handbook of Data Compression, 5th ed. Berlin: Springer, 2010, doi: 10.1007/978-1-84882-903-9.
[7]J. Alakuijala and Z. Szabadka, "Brotli Compressed Data Format," RFC 7932, IETF, July 2016, doi: 10.17487/RFC7932.
[8]K. Sayood, Introduction to Data Compression, 5th ed. Cambridge, MA, USA: Morgan Kaufmann, 2017, 703 p.
[9]Y. Collet and M. Kucherawy, "Zstandard Compression and the 'application/zstd' Media Type," RFC 8478, IETF, Oct. 2018, doi: 10.17487/RFC8478.
[10]D. Podgorelec, D. Strnad, I. Kolingerová and B. Žalik, "State-of-the-Art Trends in Data Compression: COMPROMISE Case Study," in Entropy, vol. 26, no. 12, p. 1032, Dec. 2024, doi: 10.3390/e26121032.
[11]Y. Zhang et al., "Data-Aware Adaptive Compression for Stream Processing," in IEEE Transactions on Knowledge and Data Engineering, 2024. Available: https://ieeexplore.ieee.org/document/10473167
[12]V. Kovtun, "Adaptive Information-Constrained Feature Compression for Distributed Intelligent Systems," in Scientific Reports, 2025, doi: 10.1038/s41598-025-16604-2.
[13]G. Flamich, "Data Compression With Relative Entropy Coding", 2025. Available: https://arxiv.org/abs/2506.16309
[14]Z. Lu et al., "EDPC: Accelerating Lossless Compression via Lightweight Probability Models and Decoupled Parallel Dataflow," arXiv preprint, 2025. Available: https://arxiv.org/abs/2507.18969
[15]N. Körber et al., "PerCoV2: Improved Ultra-Low Bit-Rate Perceptual Image Compression," arXiv preprint, 2025. Available: https://arxiv.org/abs/2503.09368
[16]M. Ansarifard et al., "CSI Compression Beyond Latents: Entropy-Regularized Hybrid Attention-CNN Networks", 2025. Available: https://arxiv.org/abs/2509.08776
[17]I. V. Malyk, Y. Kyrychenko, M. Gorbatenko and T. Lukashiv, "Data Optimization Through Compression Methods Using Information Technology," in International Journal of Information Technology and Computer Science (IJITCS), vol. 17, no. 5, pp. 84-99, 2025, doi: 10.5815/ijitcs.2025.05.07.