Exploiting Multi-user Diversity and Multi-hop Diversity in Dual-hop Broadcast Channels
Type
ArticleKAUST Department
Communication Theory LabComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Electrical Engineering Program
Date
2013-06-18Online Publication Date
2013-06-18Print Publication Date
2013-07Permanent link to this record
http://hdl.handle.net/10754/292459
Metadata
Show full item recordAbstract
We propose joint user-and-hop scheduling over dual-hop block-fading broadcast channels in order to exploit multi-user diversity gains and multi-hop diversity gains all together. To achieve this objective, the first and second hops are scheduled opportunistically based on the channel state information. The joint scheduling problem is formulated as maximizing the weighted sum of the long term achievable rates of the users under a stability constraint, which means that in the long term the rate received by the relay should equal the rate transmitted by it, in addition to power constraints. We show that this problem is equivalent to a single-hop broadcast channel by treating the source as a virtual user with an optimal weight that maintains the stability constraint. We show how to obtain the source weight either off-line based on channel statistics or on real-time based on channel measurements. Furthermore, we consider special cases including the maximum sum-rate scheduler and the proportional fair scheduler. We also show how to extend the scheme into one that allows multiple user scheduling via superposition coding with successive decoding. Numerical results demonstrate that our proposed joint scheduling scheme enlarges the rate region as compared to scheduling schemes that exploit the diversity gains partially.Description
Accepted in IEEE Transactions on Wireless CommunicationsCitation
Zafar, A., Shaqfeh, M., Alouini, M.-S., & Alnuweiri, H. (2013). Exploiting Multi-User Diversity and Multi-Hop Diversity in Dual-Hop Broadcast Channels. IEEE Transactions on Wireless Communications, 12(7), 3314–3325. doi:10.1109/tw.2013.060413.121136ae974a485f413a2113503eed53cd6c53
10.1109/TW.2013.060413.121136