Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay

Handle URI:
http://hdl.handle.net/10754/564801
Title:
Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay
Authors:
Zafar, Ammar ( 0000-0001-8382-7625 ) ; Shaqfeh, Mohammad; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 ) ; Alnuweiri, Hussein M.
Abstract:
In this paper, we maximize the achievable rate region of a dual-hop network with two sources serving two users independently through a single shared relay. We formulate the problem as maximizing the sum of the weighted long term average throughputs of the two users under stability constraints on the long term throughputs of the source-user pairs. In order to solve the problem, we propose a joint user-and-hop scheduling scheme, which schedules the first or second hop opportunistically based on instantaneous channel state information, in order to exploit multiuser diversity and multihop diversity gains. Numerical results show that the proposed joint scheduling scheme enhances the achievable rate region as compared to a scheme that employs multi-user scheduling on the second-hop alone. Copyright © 2013 by the Institute of Electrical and Electronic Engineers, Inc.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Electrical Engineering Program; Communication Theory Lab
Publisher:
Institute of Electrical & Electronics Engineers (IEEE)
Journal:
2013 IEEE 78th Vehicular Technology Conference (VTC Fall)
Conference/Event name:
2013 IEEE 78th Vehicular Technology Conference, VTC Fall 2013
Issue Date:
Sep-2013
DOI:
10.1109/VTCFall.2013.6692401
Type:
Conference Paper
ISSN:
15502252
ISBN:
9781467361873
Appears in Collections:
Conference Papers; Electrical Engineering Program; Communication Theory Lab; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorZafar, Ammaren
dc.contributor.authorShaqfeh, Mohammaden
dc.contributor.authorAlouini, Mohamed-Slimen
dc.contributor.authorAlnuweiri, Hussein M.en
dc.date.accessioned2015-08-04T07:16:26Zen
dc.date.available2015-08-04T07:16:26Zen
dc.date.issued2013-09en
dc.identifier.isbn9781467361873en
dc.identifier.issn15502252en
dc.identifier.doi10.1109/VTCFall.2013.6692401en
dc.identifier.urihttp://hdl.handle.net/10754/564801en
dc.description.abstractIn this paper, we maximize the achievable rate region of a dual-hop network with two sources serving two users independently through a single shared relay. We formulate the problem as maximizing the sum of the weighted long term average throughputs of the two users under stability constraints on the long term throughputs of the source-user pairs. In order to solve the problem, we propose a joint user-and-hop scheduling scheme, which schedules the first or second hop opportunistically based on instantaneous channel state information, in order to exploit multiuser diversity and multihop diversity gains. Numerical results show that the proposed joint scheduling scheme enhances the achievable rate region as compared to a scheme that employs multi-user scheduling on the second-hop alone. Copyright © 2013 by the Institute of Electrical and Electronic Engineers, Inc.en
dc.publisherInstitute of Electrical & Electronics Engineers (IEEE)en
dc.subjectDual-hopen
dc.subjectJoint schedulingen
dc.subjectMulti-hop diversityen
dc.subjectMulti-user diversityen
dc.subjectShared relayen
dc.titleScheduling for dual-hop block-fading channels with two source-user pairs sharing one relayen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentElectrical Engineering Programen
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journal2013 IEEE 78th Vehicular Technology Conference (VTC Fall)en
dc.conference.date2 September 2013 through 5 September 2013en
dc.conference.name2013 IEEE 78th Vehicular Technology Conference, VTC Fall 2013en
dc.conference.locationLas Vegas, NVen
dc.contributor.institutionDepartment of Electrical and Computer Engineering, Texas A and M University at Qatar, Doha, Qataren
kaust.authorZafar, Ammaren
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.