A broadcast approach to robust communications over unreliable multi-relay networks

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A multi-relay network is studied in which communication from source to relays takes place over a 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 take place between any subset of relays and the destination in a non-ergodic fashion. Upper and lower bounds are derived on average achievable rates with respect to the prior distribution of the link failures. It is first assumed that relays are oblivious to the codebook shared by source and destination, and then the results are extended to the nonoblivious case. The lower bounds are obtained via strategies that combine the broadcast coding approach, previously investigated for quasi-static fading channels, and different robust distributed compression techniques.

Original languageEnglish (US)
Title of host publicationInformation Theory and Applications Workshop, ITA 2009
Pages323-333
Number of pages11
DOIs
StatePublished - 2009
EventInformation Theory and Applications Workshop, ITA 2009 - San Diego, CA, United States
Duration: Feb 8 2009Feb 13 2009

Other

OtherInformation Theory and Applications Workshop, ITA 2009
CountryUnited States
CitySan Diego, CA
Period2/8/092/13/09

Fingerprint

Fading channels
Communication

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Simeone, O., Somekh, O., Erkip, E., Poor, H. V., & Shamai, S. (2009). A broadcast approach to robust communications over unreliable multi-relay networks. In Information Theory and Applications Workshop, ITA 2009 (pp. 323-333). [5044965] https://doi.org/10.1109/ITA.2009.5044965

A broadcast approach to robust communications over unreliable multi-relay networks. / Simeone, Osvaldo; Somekh, Oren; Erkip, Elza; Poor, H. Vincent; Shamai, Shlomo.

Information Theory and Applications Workshop, ITA 2009. 2009. p. 323-333 5044965.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Simeone, O, Somekh, O, Erkip, E, Poor, HV & Shamai, S 2009, A broadcast approach to robust communications over unreliable multi-relay networks. in Information Theory and Applications Workshop, ITA 2009., 5044965, pp. 323-333, Information Theory and Applications Workshop, ITA 2009, San Diego, CA, United States, 2/8/09. https://doi.org/10.1109/ITA.2009.5044965
Simeone O, Somekh O, Erkip E, Poor HV, Shamai S. A broadcast approach to robust communications over unreliable multi-relay networks. In Information Theory and Applications Workshop, ITA 2009. 2009. p. 323-333. 5044965 https://doi.org/10.1109/ITA.2009.5044965
Simeone, Osvaldo ; Somekh, Oren ; Erkip, Elza ; Poor, H. Vincent ; Shamai, Shlomo. / A broadcast approach to robust communications over unreliable multi-relay networks. Information Theory and Applications Workshop, ITA 2009. 2009. pp. 323-333
@inproceedings{af67eebe4811484fa0deceab78b6e0e2,
title = "A broadcast approach to robust communications over unreliable multi-relay networks",
abstract = "A multi-relay network is studied in which communication from source to relays takes place over a 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 take place between any subset of relays and the destination in a non-ergodic fashion. Upper and lower bounds are derived on average achievable rates with respect to the prior distribution of the link failures. It is first assumed that relays are oblivious to the codebook shared by source and destination, and then the results are extended to the nonoblivious case. The lower bounds are obtained via strategies that combine the broadcast coding approach, previously investigated for quasi-static fading channels, and different robust distributed compression techniques.",
author = "Osvaldo Simeone and Oren Somekh and Elza Erkip and Poor, {H. Vincent} and Shlomo Shamai",
year = "2009",
doi = "10.1109/ITA.2009.5044965",
language = "English (US)",
isbn = "9781424439904",
pages = "323--333",
booktitle = "Information Theory and Applications Workshop, ITA 2009",

}

TY - GEN

T1 - A broadcast approach to robust communications over unreliable multi-relay networks

AU - Simeone, Osvaldo

AU - Somekh, Oren

AU - Erkip, Elza

AU - Poor, H. Vincent

AU - Shamai, Shlomo

PY - 2009

Y1 - 2009

N2 - A multi-relay network is studied in which communication from source to relays takes place over a 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 take place between any subset of relays and the destination in a non-ergodic fashion. Upper and lower bounds are derived on average achievable rates with respect to the prior distribution of the link failures. It is first assumed that relays are oblivious to the codebook shared by source and destination, and then the results are extended to the nonoblivious case. The lower bounds are obtained via strategies that combine the broadcast coding approach, previously investigated for quasi-static fading channels, and different robust distributed compression techniques.

AB - A multi-relay network is studied in which communication from source to relays takes place over a 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 take place between any subset of relays and the destination in a non-ergodic fashion. Upper and lower bounds are derived on average achievable rates with respect to the prior distribution of the link failures. It is first assumed that relays are oblivious to the codebook shared by source and destination, and then the results are extended to the nonoblivious case. The lower bounds are obtained via strategies that combine the broadcast coding approach, previously investigated for quasi-static fading channels, and different robust distributed compression techniques.

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

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

U2 - 10.1109/ITA.2009.5044965

DO - 10.1109/ITA.2009.5044965

M3 - Conference contribution

SN - 9781424439904

SP - 323

EP - 333

BT - Information Theory and Applications Workshop, ITA 2009

ER -