Rate and power allocation under the pairwise distributed source coding constraint

Date
2008-08-08
Authors
Li, Shizheng
Ramamoorthy, Aditya
Journal Title
Journal ISSN
Volume Title
Publisher
Altmetrics
Authors
Research Projects
Organizational Units
Journal Issue
Series
Abstract

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.

Description

This is a manuscript of a proceeding from the IEEE International Symposium on Information Theory (2008), doi:10.1109/ISIT.2008.4595403. Posted with permission.

Keywords
Citation
DOI