Fading multiple access relay channels: Achievable rates and opportunistic scheduling

Lalitha Sankar, Yingbin Liang, Narayan B. Mandayam, H. Vincent Poor

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

The problem of optimal resource allocation is studied for ergodic fading orthogonal multi-access relay channels (MARCs) in which the users (sources) communicate with a destination with the aid of a half-duplex relay that transmits and receives on orthogonal channels. Under the assumption that the instantaneous fading state information is available at all nodes, the maximum sum-rate and the optimal user and relay power allocations (policies) are developed for a decode-and-forward (DF) relay. A known lemma on the sum-rate of two intersecting polymatroids is used to determine the DF sum-rate and the optimal user and relay policies, and to classify fading MARCs into one of three types: (i) partially clustered MARCs in which a user is clustered either with the relay or with the destination, (ii) clustered MARCs in which all users are either proximal to the relay or to the destination, and (iii) arbitrarily clustered MARCs which are a combination of the first two types. Cutset outer bounds are used to show that DF achieves the capacity region for a sub-class of clustered orthogonal MARCs.

Original languageEnglish (US)
Article number5730582
Pages (from-to)1911-1931
Number of pages21
JournalIEEE Transactions on Information Theory
Volume57
Issue number4
DOIs
StatePublished - Apr 2011
Externally publishedYes

Fingerprint

Resource allocation
scheduling
Scheduling
available information
resources

Keywords

  • Decode-and-forward
  • ergodic capacity
  • fading
  • multiple-access relay channel (MARC)
  • resource allocation

ASJC Scopus subject areas

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

Cite this

Fading multiple access relay channels : Achievable rates and opportunistic scheduling. / Sankar, Lalitha; Liang, Yingbin; Mandayam, Narayan B.; Poor, H. Vincent.

In: IEEE Transactions on Information Theory, Vol. 57, No. 4, 5730582, 04.2011, p. 1911-1931.

Research output: Contribution to journalArticle

Sankar, Lalitha ; Liang, Yingbin ; Mandayam, Narayan B. ; Poor, H. Vincent. / Fading multiple access relay channels : Achievable rates and opportunistic scheduling. In: IEEE Transactions on Information Theory. 2011 ; Vol. 57, No. 4. pp. 1911-1931.
@article{8e790bf82cb24a39a7148bc304c22685,
title = "Fading multiple access relay channels: Achievable rates and opportunistic scheduling",
abstract = "The problem of optimal resource allocation is studied for ergodic fading orthogonal multi-access relay channels (MARCs) in which the users (sources) communicate with a destination with the aid of a half-duplex relay that transmits and receives on orthogonal channels. Under the assumption that the instantaneous fading state information is available at all nodes, the maximum sum-rate and the optimal user and relay power allocations (policies) are developed for a decode-and-forward (DF) relay. A known lemma on the sum-rate of two intersecting polymatroids is used to determine the DF sum-rate and the optimal user and relay policies, and to classify fading MARCs into one of three types: (i) partially clustered MARCs in which a user is clustered either with the relay or with the destination, (ii) clustered MARCs in which all users are either proximal to the relay or to the destination, and (iii) arbitrarily clustered MARCs which are a combination of the first two types. Cutset outer bounds are used to show that DF achieves the capacity region for a sub-class of clustered orthogonal MARCs.",
keywords = "Decode-and-forward, ergodic capacity, fading, multiple-access relay channel (MARC), resource allocation",
author = "Lalitha Sankar and Yingbin Liang and Mandayam, {Narayan B.} and Poor, {H. Vincent}",
year = "2011",
month = "4",
doi = "10.1109/TIT.2011.2110690",
language = "English (US)",
volume = "57",
pages = "1911--1931",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Fading multiple access relay channels

T2 - Achievable rates and opportunistic scheduling

AU - Sankar, Lalitha

AU - Liang, Yingbin

AU - Mandayam, Narayan B.

AU - Poor, H. Vincent

PY - 2011/4

Y1 - 2011/4

N2 - The problem of optimal resource allocation is studied for ergodic fading orthogonal multi-access relay channels (MARCs) in which the users (sources) communicate with a destination with the aid of a half-duplex relay that transmits and receives on orthogonal channels. Under the assumption that the instantaneous fading state information is available at all nodes, the maximum sum-rate and the optimal user and relay power allocations (policies) are developed for a decode-and-forward (DF) relay. A known lemma on the sum-rate of two intersecting polymatroids is used to determine the DF sum-rate and the optimal user and relay policies, and to classify fading MARCs into one of three types: (i) partially clustered MARCs in which a user is clustered either with the relay or with the destination, (ii) clustered MARCs in which all users are either proximal to the relay or to the destination, and (iii) arbitrarily clustered MARCs which are a combination of the first two types. Cutset outer bounds are used to show that DF achieves the capacity region for a sub-class of clustered orthogonal MARCs.

AB - The problem of optimal resource allocation is studied for ergodic fading orthogonal multi-access relay channels (MARCs) in which the users (sources) communicate with a destination with the aid of a half-duplex relay that transmits and receives on orthogonal channels. Under the assumption that the instantaneous fading state information is available at all nodes, the maximum sum-rate and the optimal user and relay power allocations (policies) are developed for a decode-and-forward (DF) relay. A known lemma on the sum-rate of two intersecting polymatroids is used to determine the DF sum-rate and the optimal user and relay policies, and to classify fading MARCs into one of three types: (i) partially clustered MARCs in which a user is clustered either with the relay or with the destination, (ii) clustered MARCs in which all users are either proximal to the relay or to the destination, and (iii) arbitrarily clustered MARCs which are a combination of the first two types. Cutset outer bounds are used to show that DF achieves the capacity region for a sub-class of clustered orthogonal MARCs.

KW - Decode-and-forward

KW - ergodic capacity

KW - fading

KW - multiple-access relay channel (MARC)

KW - resource allocation

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

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

U2 - 10.1109/TIT.2011.2110690

DO - 10.1109/TIT.2011.2110690

M3 - Article

AN - SCOPUS:79952826636

VL - 57

SP - 1911

EP - 1931

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 4

M1 - 5730582

ER -