Resource allocation for two source-destination pairs sharing a single relay with a buffer

Ammar Zafar, Mohammad Shaqfeh, Mohamed Slim Alouini, Hussein Alnuweiri

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

In this paper, we obtain the optimal resource allocation scheme in order to maximize the achievable rate region in a dual-hop system that consists of two independent source-destination pairs sharing a single half-duplex relay. The relay decodes the received information and possesses buffers to enable storing the information temporarily before forwarding it to the respective destination. We consider both non-orthogonal transmission with successive interference cancellation at the receivers and orthogonal transmission. Also, we consider Gaussian block-fading channels and we assume that the channel state information is known and that no delay constraints are required. We show that, with the aid of buffering at the relay, joint user-and-hop scheduling is optimal and can enhance the achievable rate significantly. This is due to the joint exploitation of multiuser diversity and multihop diversity in the system. We provide closed-form expressions to characterize the average achievable rates in a generic form as functions of the statistical model of the channels. Furthermore, we consider sub-optimal schemes that exploit the diversity in the system partially and we provide numerical results to compare the different schemes and demonstrate the gains of the optimal one.

Original languageEnglish
Article number6783948
Pages (from-to)1444-1457
Number of pages14
JournalIEEE Transactions on Communications
Volume62
Issue number5
DOIs
Publication statusPublished - 2014

Fingerprint

Resource allocation
Channel state information
Fading channels
Scheduling
Statistical Models

Keywords

  • achievable rate region
  • block-fading channels
  • joint user-and-hop scheduling
  • Optimal resource allocation
  • relay with a buffer
  • shared relay

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Resource allocation for two source-destination pairs sharing a single relay with a buffer. / Zafar, Ammar; Shaqfeh, Mohammad; Alouini, Mohamed Slim; Alnuweiri, Hussein.

In: IEEE Transactions on Communications, Vol. 62, No. 5, 6783948, 2014, p. 1444-1457.

Research output: Contribution to journalArticle

@article{5ba2d99e4d624aef82170f74ea3e1f64,
title = "Resource allocation for two source-destination pairs sharing a single relay with a buffer",
abstract = "In this paper, we obtain the optimal resource allocation scheme in order to maximize the achievable rate region in a dual-hop system that consists of two independent source-destination pairs sharing a single half-duplex relay. The relay decodes the received information and possesses buffers to enable storing the information temporarily before forwarding it to the respective destination. We consider both non-orthogonal transmission with successive interference cancellation at the receivers and orthogonal transmission. Also, we consider Gaussian block-fading channels and we assume that the channel state information is known and that no delay constraints are required. We show that, with the aid of buffering at the relay, joint user-and-hop scheduling is optimal and can enhance the achievable rate significantly. This is due to the joint exploitation of multiuser diversity and multihop diversity in the system. We provide closed-form expressions to characterize the average achievable rates in a generic form as functions of the statistical model of the channels. Furthermore, we consider sub-optimal schemes that exploit the diversity in the system partially and we provide numerical results to compare the different schemes and demonstrate the gains of the optimal one.",
keywords = "achievable rate region, block-fading channels, joint user-and-hop scheduling, Optimal resource allocation, relay with a buffer, shared relay",
author = "Ammar Zafar and Mohammad Shaqfeh and Alouini, {Mohamed Slim} and Hussein Alnuweiri",
year = "2014",
doi = "10.1109/TCOMM.2014.031614.130226",
language = "English",
volume = "62",
pages = "1444--1457",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Resource allocation for two source-destination pairs sharing a single relay with a buffer

AU - Zafar, Ammar

AU - Shaqfeh, Mohammad

AU - Alouini, Mohamed Slim

AU - Alnuweiri, Hussein

PY - 2014

Y1 - 2014

N2 - In this paper, we obtain the optimal resource allocation scheme in order to maximize the achievable rate region in a dual-hop system that consists of two independent source-destination pairs sharing a single half-duplex relay. The relay decodes the received information and possesses buffers to enable storing the information temporarily before forwarding it to the respective destination. We consider both non-orthogonal transmission with successive interference cancellation at the receivers and orthogonal transmission. Also, we consider Gaussian block-fading channels and we assume that the channel state information is known and that no delay constraints are required. We show that, with the aid of buffering at the relay, joint user-and-hop scheduling is optimal and can enhance the achievable rate significantly. This is due to the joint exploitation of multiuser diversity and multihop diversity in the system. We provide closed-form expressions to characterize the average achievable rates in a generic form as functions of the statistical model of the channels. Furthermore, we consider sub-optimal schemes that exploit the diversity in the system partially and we provide numerical results to compare the different schemes and demonstrate the gains of the optimal one.

AB - In this paper, we obtain the optimal resource allocation scheme in order to maximize the achievable rate region in a dual-hop system that consists of two independent source-destination pairs sharing a single half-duplex relay. The relay decodes the received information and possesses buffers to enable storing the information temporarily before forwarding it to the respective destination. We consider both non-orthogonal transmission with successive interference cancellation at the receivers and orthogonal transmission. Also, we consider Gaussian block-fading channels and we assume that the channel state information is known and that no delay constraints are required. We show that, with the aid of buffering at the relay, joint user-and-hop scheduling is optimal and can enhance the achievable rate significantly. This is due to the joint exploitation of multiuser diversity and multihop diversity in the system. We provide closed-form expressions to characterize the average achievable rates in a generic form as functions of the statistical model of the channels. Furthermore, we consider sub-optimal schemes that exploit the diversity in the system partially and we provide numerical results to compare the different schemes and demonstrate the gains of the optimal one.

KW - achievable rate region

KW - block-fading channels

KW - joint user-and-hop scheduling

KW - Optimal resource allocation

KW - relay with a buffer

KW - shared relay

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

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

U2 - 10.1109/TCOMM.2014.031614.130226

DO - 10.1109/TCOMM.2014.031614.130226

M3 - Article

VL - 62

SP - 1444

EP - 1457

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 5

M1 - 6783948

ER -