Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding

Conference

IEEE International Symposium on Information Theory, 2008. ISIT 2008

Publication Version

Accepted Manuscript

Link to Published Version

https://doi.org/10.1109/ISIT.2008.4595403

Publication Date

8-8-2008

Journal or Book Title

IEEE International Symposium on Information Theory, 2008

First Page

2312

Last Page

2316

DOI

10.1109/ISIT.2008.4595403

Conference Title

IEEE International Symposium on Information Theory, 2008

Conference Date

July 6-11, 2008

City

Toronto, CA

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.

Comments

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.

Rights

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright Owner

IEEE

Language

en

File Format

application/pdf

Published Version

Share

Article Location

 
COinS