Joint scheduling for dual-hop block-fading broadcast channels

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

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

7 Citations (Scopus)

Abstract

In this paper, 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 and as a prerequisite we assume that the relay, which is half-duplex and operates using decode-and-forward, is capable of storing the received packets from the source until the channel condition of the destined user becomes good to be scheduled. We formulate the joint scheduling problem as maximizing the weighted sum of the long term achievable rates by the users under a stability constraint, which means that on the long term the rate received by the relay should equal the rate transmitted by it, in addition to constant or variable 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 priority 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 demonstrate via numerical results that our proposed joint scheduling scheme enlarges the rate region as compared with a scheme that employs multi-user scheduling alone.

Original languageEnglish
Title of host publication2012 IEEE Globecom Workshops, GC Wkshps 2012
Pages140-145
Number of pages6
DOIs
Publication statusPublished - 2012
Event2012 IEEE Globecom Workshops, GC Wkshps 2012 - Anaheim, CA, United States
Duration: 3 Dec 20127 Dec 2012

Other

Other2012 IEEE Globecom Workshops, GC Wkshps 2012
CountryUnited States
CityAnaheim, CA
Period3/12/127/12/12

Fingerprint

Fading channels
Scheduling
Channel state information
Statistics

Keywords

  • Broadcast channel
  • dual-hop
  • joint scheduling
  • multi-hop diversity
  • multi-user diversity

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Zafar, A., Shaqfeh, M., Alouini, M. S., & Alnuweiri, H. (2012). Joint scheduling for dual-hop block-fading broadcast channels. In 2012 IEEE Globecom Workshops, GC Wkshps 2012 (pp. 140-145). [6477559] https://doi.org/10.1109/GLOCOMW.2012.6477559

Joint scheduling for dual-hop block-fading broadcast channels. / Zafar, Ammar; Shaqfeh, Mohammad; Alouini, Mohamed Slim; Alnuweiri, Hussein.

2012 IEEE Globecom Workshops, GC Wkshps 2012. 2012. p. 140-145 6477559.

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

Zafar, A, Shaqfeh, M, Alouini, MS & Alnuweiri, H 2012, Joint scheduling for dual-hop block-fading broadcast channels. in 2012 IEEE Globecom Workshops, GC Wkshps 2012., 6477559, pp. 140-145, 2012 IEEE Globecom Workshops, GC Wkshps 2012, Anaheim, CA, United States, 3/12/12. https://doi.org/10.1109/GLOCOMW.2012.6477559
Zafar A, Shaqfeh M, Alouini MS, Alnuweiri H. Joint scheduling for dual-hop block-fading broadcast channels. In 2012 IEEE Globecom Workshops, GC Wkshps 2012. 2012. p. 140-145. 6477559 https://doi.org/10.1109/GLOCOMW.2012.6477559
Zafar, Ammar ; Shaqfeh, Mohammad ; Alouini, Mohamed Slim ; Alnuweiri, Hussein. / Joint scheduling for dual-hop block-fading broadcast channels. 2012 IEEE Globecom Workshops, GC Wkshps 2012. 2012. pp. 140-145
@inproceedings{f0b51b10f8594dd2ac35a8da3d4ad006,
title = "Joint scheduling for dual-hop block-fading broadcast channels",
abstract = "In this paper, 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 and as a prerequisite we assume that the relay, which is half-duplex and operates using decode-and-forward, is capable of storing the received packets from the source until the channel condition of the destined user becomes good to be scheduled. We formulate the joint scheduling problem as maximizing the weighted sum of the long term achievable rates by the users under a stability constraint, which means that on the long term the rate received by the relay should equal the rate transmitted by it, in addition to constant or variable 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 priority 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 demonstrate via numerical results that our proposed joint scheduling scheme enlarges the rate region as compared with a scheme that employs multi-user scheduling alone.",
keywords = "Broadcast channel, dual-hop, joint scheduling, multi-hop diversity, multi-user diversity",
author = "Ammar Zafar and Mohammad Shaqfeh and Alouini, {Mohamed Slim} and Hussein Alnuweiri",
year = "2012",
doi = "10.1109/GLOCOMW.2012.6477559",
language = "English",
isbn = "9781467349413",
pages = "140--145",
booktitle = "2012 IEEE Globecom Workshops, GC Wkshps 2012",

}

TY - GEN

T1 - Joint scheduling for dual-hop block-fading broadcast channels

AU - Zafar, Ammar

AU - Shaqfeh, Mohammad

AU - Alouini, Mohamed Slim

AU - Alnuweiri, Hussein

PY - 2012

Y1 - 2012

N2 - In this paper, 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 and as a prerequisite we assume that the relay, which is half-duplex and operates using decode-and-forward, is capable of storing the received packets from the source until the channel condition of the destined user becomes good to be scheduled. We formulate the joint scheduling problem as maximizing the weighted sum of the long term achievable rates by the users under a stability constraint, which means that on the long term the rate received by the relay should equal the rate transmitted by it, in addition to constant or variable 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 priority 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 demonstrate via numerical results that our proposed joint scheduling scheme enlarges the rate region as compared with a scheme that employs multi-user scheduling alone.

AB - In this paper, 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 and as a prerequisite we assume that the relay, which is half-duplex and operates using decode-and-forward, is capable of storing the received packets from the source until the channel condition of the destined user becomes good to be scheduled. We formulate the joint scheduling problem as maximizing the weighted sum of the long term achievable rates by the users under a stability constraint, which means that on the long term the rate received by the relay should equal the rate transmitted by it, in addition to constant or variable 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 priority 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 demonstrate via numerical results that our proposed joint scheduling scheme enlarges the rate region as compared with a scheme that employs multi-user scheduling alone.

KW - Broadcast channel

KW - dual-hop

KW - joint scheduling

KW - multi-hop diversity

KW - multi-user diversity

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

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

U2 - 10.1109/GLOCOMW.2012.6477559

DO - 10.1109/GLOCOMW.2012.6477559

M3 - Conference contribution

AN - SCOPUS:84875659315

SN - 9781467349413

SP - 140

EP - 145

BT - 2012 IEEE Globecom Workshops, GC Wkshps 2012

ER -