2008/07/15 by Shizheng Li, Li, Shizheng, Aditya Ramamoorthy +1
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #E.4 #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.0807.2292
The first version was published in ISIT 2008. The new version includes all detailed proofs and more simulation results. The latest version has been accepted by IEEE Transactions on Communications
openalex publication_date 2008/07/15 · arxiv created 2009/06/09 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the problem of rate and power allocation for a sensor network under the pairwise distributed source coding constraint. For noiseless source-terminal channels, we show that the minimum sum rate assignment can be found by finding a minimum weight arborescence in an appropriately defined directed graph. For orthogonal noisy source-terminal channels, the minimum sum power allocation can be found by finding a minimum weight matching forest in a mixed graph. Numerical results are presented for both cases showing that our solutions always outperform previously proposed solutions. The gains are considerable when source correlations are high.