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

Handle URI:
http://hdl.handle.net/10754/563526
Title:
Resource allocation for two source-destination pairs sharing a single relay with a buffer
Authors:
Zafar, Ammar ( 0000-0001-8382-7625 ) ; Shaqfeh, Mohammad; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 ) ; Alnuweiri, Hussein M.
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. © 2014 IEEE.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Electrical Engineering Program; Communication Theory Lab
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
IEEE Transactions on Communications
Issue Date:
May-2014
DOI:
10.1109/TCOMM.2014.031614.130226
Type:
Article
ISSN:
00906778
Sponsors:
This paper was made possible by YSREP grant # 2-011-2-002 from the Qatar National Research Fund (a member of Qatar Foundation). Furthermore, King Abdulaziz City of Science and Technology (KACST) funded the efforts of A. Zafar partially and the efforts of M.-S. Alouini. The statements made herein are solely the responsibility of the authors.
Appears in Collections:
Articles; 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-03T11:53:40Zen
dc.date.available2015-08-03T11:53:40Zen
dc.date.issued2014-05en
dc.identifier.issn00906778en
dc.identifier.doi10.1109/TCOMM.2014.031614.130226en
dc.identifier.urihttp://hdl.handle.net/10754/563526en
dc.description.abstractIn 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. © 2014 IEEE.en
dc.description.sponsorshipThis paper was made possible by YSREP grant # 2-011-2-002 from the Qatar National Research Fund (a member of Qatar Foundation). Furthermore, King Abdulaziz City of Science and Technology (KACST) funded the efforts of A. Zafar partially and the efforts of M.-S. Alouini. The statements made herein are solely the responsibility of the authors.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.subjectachievable rate regionen
dc.subjectblock-fading channelsen
dc.subjectjoint user-and-hop schedulingen
dc.subjectOptimal resource allocationen
dc.subjectrelay with a bufferen
dc.subjectshared relayen
dc.titleResource allocation for two source-destination pairs sharing a single relay with a bufferen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentElectrical Engineering Programen
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journalIEEE Transactions on Communicationsen
dc.contributor.institutionDepartment of Electrical and Computer Engineering, Texas A and M University at Qatar, Qatar Foundation, PO Box 23874, Doha, Qataren
kaust.authorZafar, Ammaren
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.