Exploiting multi-user diversity and multi-hop diversity in dual-hop broadcast channels

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

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

We propose joint user-and-hop scheduling over dual-hop block-fading broadcast channels in order to exploit multi-user diversity gains and multi-hop diversity gains all together. To achieve this objective, the first and second hops are scheduled opportunistically based on the channel state information. The joint scheduling problem is formulated as maximizing the weighted sum of the long term achievable rates of the users under a stability constraint, which means that in the long term the rate received by the relay should equal the rate transmitted by it, in addition to power constraints. We show that this problem is equivalent to a single-hop broadcast channel by treating the source as a virtual user with an optimal weight that maintains the stability constraint. We show how to obtain the source weight either off-line based on channel statistics or on real-time based on channel measurements. Furthermore, we consider special cases including the maximum sum-rate scheduler and the proportional fair scheduler. We also show how to extend the scheme into one that allows multiple user scheduling via superposition coding with successive decoding. Numerical results demonstrate that our proposed joint scheduling scheme enlarges the rate region as compared to scheduling schemes that exploit the diversity gains partially.

Original languageEnglish
Article number6542784
Pages (from-to)3314-3325
Number of pages12
JournalIEEE Transactions on Wireless Communications
Volume12
Issue number7
DOIs
Publication statusPublished - 2013

Fingerprint

Multiuser Diversity
Broadcast Channel
Multi-hop
Diversity Gain
Scheduling
Scheduler
Channel State Information
Term
Weighted Sums
Fading
Relay
Superposition
Decoding
Channel state information
Scheduling Problem
Coding
Fading channels
Directly proportional
Statistics
Real-time

Keywords

  • block-fading
  • Broadcast channels
  • dual-hop
  • joint scheduling
  • multi-hop diversity
  • multi-user diversity
  • optimal resource allocation

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Exploiting multi-user diversity and multi-hop diversity in dual-hop broadcast channels. / Zafar, Ammar; Shaqfeh, Mohammad; Alouini, Mohamed Slim; Alnuweiri, Hussein.

In: IEEE Transactions on Wireless Communications, Vol. 12, No. 7, 6542784, 2013, p. 3314-3325.

Research output: Contribution to journalArticle

@article{059e9e2f184c4bf58c8a3af299bf7eca,
title = "Exploiting multi-user diversity and multi-hop diversity in dual-hop broadcast channels",
abstract = "We propose joint user-and-hop scheduling over dual-hop block-fading broadcast channels in order to exploit multi-user diversity gains and multi-hop diversity gains all together. To achieve this objective, the first and second hops are scheduled opportunistically based on the channel state information. The joint scheduling problem is formulated as maximizing the weighted sum of the long term achievable rates of the users under a stability constraint, which means that in the long term the rate received by the relay should equal the rate transmitted by it, in addition to power constraints. We show that this problem is equivalent to a single-hop broadcast channel by treating the source as a virtual user with an optimal weight that maintains the stability constraint. We show how to obtain the source weight either off-line based on channel statistics or on real-time based on channel measurements. Furthermore, we consider special cases including the maximum sum-rate scheduler and the proportional fair scheduler. We also show how to extend the scheme into one that allows multiple user scheduling via superposition coding with successive decoding. Numerical results demonstrate that our proposed joint scheduling scheme enlarges the rate region as compared to scheduling schemes that exploit the diversity gains partially.",
keywords = "block-fading, Broadcast channels, dual-hop, joint scheduling, multi-hop diversity, multi-user diversity, optimal resource allocation",
author = "Ammar Zafar and Mohammad Shaqfeh and Alouini, {Mohamed Slim} and Hussein Alnuweiri",
year = "2013",
doi = "10.1109/TW.2013.060413.121136",
language = "English",
volume = "12",
pages = "3314--3325",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Exploiting multi-user diversity and multi-hop diversity in dual-hop broadcast channels

AU - Zafar, Ammar

AU - Shaqfeh, Mohammad

AU - Alouini, Mohamed Slim

AU - Alnuweiri, Hussein

PY - 2013

Y1 - 2013

N2 - We propose joint user-and-hop scheduling over dual-hop block-fading broadcast channels in order to exploit multi-user diversity gains and multi-hop diversity gains all together. To achieve this objective, the first and second hops are scheduled opportunistically based on the channel state information. The joint scheduling problem is formulated as maximizing the weighted sum of the long term achievable rates of the users under a stability constraint, which means that in the long term the rate received by the relay should equal the rate transmitted by it, in addition to power constraints. We show that this problem is equivalent to a single-hop broadcast channel by treating the source as a virtual user with an optimal weight that maintains the stability constraint. We show how to obtain the source weight either off-line based on channel statistics or on real-time based on channel measurements. Furthermore, we consider special cases including the maximum sum-rate scheduler and the proportional fair scheduler. We also show how to extend the scheme into one that allows multiple user scheduling via superposition coding with successive decoding. Numerical results demonstrate that our proposed joint scheduling scheme enlarges the rate region as compared to scheduling schemes that exploit the diversity gains partially.

AB - We propose joint user-and-hop scheduling over dual-hop block-fading broadcast channels in order to exploit multi-user diversity gains and multi-hop diversity gains all together. To achieve this objective, the first and second hops are scheduled opportunistically based on the channel state information. The joint scheduling problem is formulated as maximizing the weighted sum of the long term achievable rates of the users under a stability constraint, which means that in the long term the rate received by the relay should equal the rate transmitted by it, in addition to power constraints. We show that this problem is equivalent to a single-hop broadcast channel by treating the source as a virtual user with an optimal weight that maintains the stability constraint. We show how to obtain the source weight either off-line based on channel statistics or on real-time based on channel measurements. Furthermore, we consider special cases including the maximum sum-rate scheduler and the proportional fair scheduler. We also show how to extend the scheme into one that allows multiple user scheduling via superposition coding with successive decoding. Numerical results demonstrate that our proposed joint scheduling scheme enlarges the rate region as compared to scheduling schemes that exploit the diversity gains partially.

KW - block-fading

KW - Broadcast channels

KW - dual-hop

KW - joint scheduling

KW - multi-hop diversity

KW - multi-user diversity

KW - optimal resource allocation

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

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

U2 - 10.1109/TW.2013.060413.121136

DO - 10.1109/TW.2013.060413.121136

M3 - Article

VL - 12

SP - 3314

EP - 3325

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 7

M1 - 6542784

ER -