Robust communication via decentralized processing with unreliable backhaul links

Osvaldo Simeone, Oren Somekh, Elza Erkip, H. Vincent Poor, Shlomo Shamai

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Article number5895092
Pages (from-to)4187-4201
Number of pages15
JournalIEEE Transactions on Information Theory
Volume57
Issue number7
DOIs
StatePublished - Jul 2011

Fingerprint

broadcast
Fading channels
communication
Communication
Processing
coding
recipient
regime
scenario

Keywords

  • Broadcast coding
  • distributed source coding
  • erasure channel
  • relay channel
  • robust channel coding

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Robust communication via decentralized processing with unreliable backhaul links. / Simeone, Osvaldo; Somekh, Oren; Erkip, Elza; Poor, H. Vincent; Shamai, Shlomo.

In: IEEE Transactions on Information Theory, Vol. 57, No. 7, 5895092, 07.2011, p. 4187-4201.

Research output: Contribution to journalArticle

Simeone, Osvaldo ; Somekh, Oren ; Erkip, Elza ; Poor, H. Vincent ; Shamai, Shlomo. / Robust communication via decentralized processing with unreliable backhaul links. In: IEEE Transactions on Information Theory. 2011 ; Vol. 57, No. 7. pp. 4187-4201.
@article{db2f737f6f33453fba42376ba925ea40,
title = "Robust communication via decentralized processing with unreliable backhaul links",
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.",
keywords = "Broadcast coding, distributed source coding, erasure channel, relay channel, robust channel coding",
author = "Osvaldo Simeone and Oren Somekh and Elza Erkip and Poor, {H. Vincent} and Shlomo Shamai",
year = "2011",
month = "7",
doi = "10.1109/TIT.2011.2145830",
language = "English (US)",
volume = "57",
pages = "4187--4201",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Robust communication via decentralized processing with unreliable backhaul links

AU - Simeone, Osvaldo

AU - Somekh, Oren

AU - Erkip, Elza

AU - Poor, H. Vincent

AU - Shamai, Shlomo

PY - 2011/7

Y1 - 2011/7

N2 - 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.

AB - 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.

KW - Broadcast coding

KW - distributed source coding

KW - erasure channel

KW - relay channel

KW - robust channel coding

UR - http://www.scopus.com/inward/record.url?scp=79959541889&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79959541889&partnerID=8YFLogxK

U2 - 10.1109/TIT.2011.2145830

DO - 10.1109/TIT.2011.2145830

M3 - Article

VL - 57

SP - 4187

EP - 4201

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 7

M1 - 5895092

ER -