vix.ing · top · new · best · stats · spec

Non-Adaptive Distributed Compression in Networks

2013/01/25 by Mahdy Nabaee, Nabaee, Mahdy, Fabrice Labeau +1
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Full-Duplex Wireless Communications #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1301.5973

Submitted for 2013 IEEE International Symposium on Information Theory

arxiv created 2013/01/25 · openalex publication_date 2013/01/25 · arxiv updated 2013/01/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we discuss non-adaptive distributed compression of inter-node correlated real-valued messages. To do so, we discuss the performance of conventional packet forwarding via routing, in terms of the total network load versus the resulting quality of service (distortion level). As a better alternative for packet forwarding, we briefly describe our previously proposed one-step Quantized Network Coding (QNC), and make motivating arguments on its advantage when the appropriate marginal rates for distributed source coding are not available at the encoder source nodes. We also derive analytic guarantees on the resulting distortion of our one-step QNC scenario. Finally, we conclude the paper by providing a mathematical comparison between the total network loads of one-step QNC and conventional packet forwarding, showing a significant reduction in the case of one-step QNC.

Related