Joint opportunistic scheduling and network coding for bidirectional relay channel
Type
Conference PaperKAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) DivisionElectrical Engineering Program
Communication Theory Lab
Date
2013-07Permanent link to this record
http://hdl.handle.net/10754/564766
Metadata
Show full item recordAbstract
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. © 2013 IEEE.Citation
Shaqfeh, M., Zafar, A., Alnuweiri, H., & Alouini, M.-S. (2013). Joint opportunistic scheduling and network coding for bidirectional relay channel. 2013 IEEE International Symposium on Information Theory. doi:10.1109/isit.2013.6620442Conference/Event name
2013 IEEE International Symposium on Information Theory, ISIT 2013ISBN
9781479904464ae974a485f413a2113503eed53cd6c53
10.1109/ISIT.2013.6620442