Rate and power allocation under the pairwise distributed source coding constraint

We explore the problem of rate and power allocation for a sensor network where pairwise distributed source coding is employed (introduced by Roumy and Gesbert `07). For noiseless node-terminal channels, we show that the minimum sum rate assignment with this property can be found by finding a minimum weight arborescence in an appropriately defined directed graph. For orthogonal noisy node-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 the noiseless case showing that our solution outperforms previous solutions when source correlations are high.

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Shizheng Li, Aditya Ramamoorthy
• Keywords: CORR 2008, Education, Minimum Sum, Minimum Weight, Power Allocation