Show simple item record

dc.contributor.authorZafar, Ammar
dc.contributor.authorShaqfeh, Mohammad
dc.contributor.authorAlouini, Mohamed-Slim
dc.contributor.authorAlnuweiri, Hussein M.
dc.date.accessioned2015-08-03T11:53:40Z
dc.date.available2015-08-03T11:53:40Z
dc.date.issued2014-05
dc.identifier.citationZafar, A., Shaqfeh, M., Alouini, M.-S., & Alnuweiri, H. (2014). Resource Allocation for Two Source-Destination Pairs Sharing a Single Relay with a Buffer. IEEE Transactions on Communications, 62(5), 1444–1457. doi:10.1109/tcomm.2014.031614.130226
dc.identifier.issn00906778
dc.identifier.doi10.1109/TCOMM.2014.031614.130226
dc.identifier.urihttp://hdl.handle.net/10754/563526
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.
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.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectachievable rate region
dc.subjectblock-fading channels
dc.subjectjoint user-and-hop scheduling
dc.subjectOptimal resource allocation
dc.subjectrelay with a buffer
dc.subjectshared relay
dc.titleResource allocation for two source-destination pairs sharing a single relay with a buffer
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentElectrical Engineering Program
dc.contributor.departmentCommunication Theory Lab
dc.identifier.journalIEEE Transactions on Communications
dc.contributor.institutionDepartment of Electrical and Computer Engineering, Texas A and M University at Qatar, Qatar Foundation, PO Box 23874, Doha, Qatar
kaust.personZafar, Ammar
kaust.personAlouini, Mohamed-Slim


This item appears in the following Collection(s)

Show simple item record