Robust communication via decentralized processing with unreliable backhaul links

Document Type

Article

Publication Date

7-1-2011

Abstract

A source communicates with a remote destination via a number of distributed relays. Communication from source to relays takes place over a (discrete or Gaussian) broadcast channel, while the relays are connected to the receiver via orthogonal finite-capacity links. Unbeknownst to the source and relays, link failures may occur between any subset of relays and the destination in a nonergodic fashion. Upper and lower bounds are derived on average achievable rates with respect to the prior distribution of the link failures, assuming the relays to be oblivious to the source codebook. The lower bounds are obtained by proposing strategies that combine the broadcast coding approach, previously investigated for quasi-static fading channels, and different robust distributed compression techniques. Numerical results show that lower and upper bounds are quite close over most operating regimes, and provide insight into optimal transmission design choices for the scenario at hand. Extension to the case of nonoblivious relays is also discussed. © 2011 IEEE.

Identifier

79959541889 (Scopus)

Publication Title

IEEE Transactions on Information Theory

External Full Text Location

https://doi.org/10.1109/TIT.2011.2145830

ISSN

00189448

First Page

4187

Last Page

4201

Issue

7

Volume

57

Grant

CCF-0635177

Fund Ref

Israel Science Foundation

This document is currently not available here.

Share

COinS