DocumentCode
640104
Title
Joint opportunistic scheduling and network coding for bidirectional relay channel
Author
Shaqfeh, M. ; Zafar, Ammar ; Alnuweiri, Hussein ; Alouini, Mohamed-Slim
Author_Institution
Dept. of Electr. & Comput. Eng., Texas A&M Univ. at Qatar, Doha, Qatar
fYear
2013
fDate
7-12 July 2013
Firstpage
1327
Lastpage
1331
Abstract
In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users´ transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited.
Keywords
fading channels; network coding; relay networks (telecommunication); scheduling; Lagrangian dual problem; bidirectional relay channel; block-fading channels; intermediate relay; joint opportunistic scheduling; linear network coding; long-term average transmission rate; optimal opportunistic scheduling scheme; optimal scheduling scheme; symmetric information flow; two-way communication system; Downlink; Gain; Network coding; Optimal scheduling; Relays; Uplink; Bidirectional relay; block-fading; linear network coding; multi-user diversity; opportunistic scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location
Istanbul
ISSN
2157-8095
Type
conf
DOI
10.1109/ISIT.2013.6620442
Filename
6620442
Link To Document