Non-adaptive distributed compression in networks

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. * M. Nabaee and F. Labeau are with the

Quantized Network Coding for correlated sources

“…As a result, the performance of QNC degrades when k increases, which can be seen in Figure 7a QNC scenario. We are currently studying such possibility, and our initial findings are reported in [45,46].…”

“…Specifically, we have suggested the use of belief propagationbased decoding [45] in a Bayesian scenario. However, more theoretical work is needed to derive mathematical guarantees for robust recovery.…”