Handle URI:
http://hdl.handle.net/10754/244151
Title:
Joint Scheduling for Dual-Hop Block-Fading Broadcast Channels
Authors:
Zafar, Ammar ( 0000-0001-8382-7625 ) ; AlNuweiri, Hussein; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 ) ; Shaqfeh, Mohammad
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Communication Theory Lab
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2012 IEEE Globecom Workshops
Conference/Event name:
2012 IEEE Globecom Workshops, GC Wkshps 2012
Issue Date:
16-Sep-2012
DOI:
10.1109/GLOCOMW.2012.6477559
Type:
Conference Paper
Description:
This paper has been accepted in Proceedings of the 8th Broadband Wireless Access Workshop (BWA) in conjunction with IEEE Global Communications Conference (GLOBECOM) 2012.
Appears in Collections:
Conference Papers; Communication Theory Lab; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorZafar, Ammaren
dc.contributor.authorAlNuweiri, Husseinen
dc.contributor.authorAlouini, Mohamed-Slimen
dc.contributor.authorShaqfeh, Mohammaden
dc.date.accessioned2012-09-16T16:16:08Z-
dc.date.available2012-09-16T16:16:08Z-
dc.date.issued2012-09-16en
dc.identifier.doi10.1109/GLOCOMW.2012.6477559en
dc.identifier.urihttp://hdl.handle.net/10754/244151en
dc.descriptionThis paper has been accepted in Proceedings of the 8th Broadband Wireless Access Workshop (BWA) in conjunction with IEEE Global Communications Conference (GLOBECOM) 2012.en
dc.description.abstractIn 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.en
dc.language.isoenen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.rightsThis paper comes under the IEEE copyright agreement and their terms of use apply.en
dc.titleJoint Scheduling for Dual-Hop Block-Fading Broadcast Channelsen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journal2012 IEEE Globecom Workshopsen
dc.conference.date3 December 2012 through 7 December 2012en
dc.conference.name2012 IEEE Globecom Workshops, GC Wkshps 2012en
dc.conference.locationAnaheim, CAen
dc.eprint.versionPre-printen
kaust.authorZafar, Ammaren
kaust.authorAlouini, Mohamed-Slimen
kaust.authorAlNuweiri, Husseinen
This item is licensed under a Creative Commons License
Creative Commons
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.