Fading multiple access relay channels: Achievable rates and opportunistic scheduling

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

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

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

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

Fingerprint Dive into the research topics of 'Fading multiple access relay channels: Achievable rates and opportunistic scheduling'. Together they form a unique fingerprint.

Cite this