TY - GEN
T1 - Application of joint source-relay scheduling to cooperative multiple access channels
AU - Ding, Zhiguo
AU - Leung, Kin
AU - Goeckel, Dennis L.
AU - Towsley, Don
PY - 2009
Y1 - 2009
N2 - In this paper, we propose a novel spectrally efficient cooperative transmission protocol for multiple access scenarios. Different to some existing cooperative multiple access schemes, the proposed scheme can exploit the availability of relays as an extra dimension to increase reception robustness. By carefully scheduling the multiple sources and relays' transmission, a source with a poor connection to the destination can have higher priority to obtain better help from relays. As a result, the full diversity gain can be achievable for each user although only a fraction of the all relays is scheduled to help him. An achievable diversity-multiplexing tradeoff (DMT) is developed for the proposed transmission protocol to assist performance evaluation. With a large number of relays, the DMT achieved by the proposed scheme can approximate the optimal multiple-input single-input upper bound. Both analytical and numerical results show that the proposed protocol can outperform comparative schemes in most conditions.
AB - In this paper, we propose a novel spectrally efficient cooperative transmission protocol for multiple access scenarios. Different to some existing cooperative multiple access schemes, the proposed scheme can exploit the availability of relays as an extra dimension to increase reception robustness. By carefully scheduling the multiple sources and relays' transmission, a source with a poor connection to the destination can have higher priority to obtain better help from relays. As a result, the full diversity gain can be achievable for each user although only a fraction of the all relays is scheduled to help him. An achievable diversity-multiplexing tradeoff (DMT) is developed for the proposed transmission protocol to assist performance evaluation. With a large number of relays, the DMT achieved by the proposed scheme can approximate the optimal multiple-input single-input upper bound. Both analytical and numerical results show that the proposed protocol can outperform comparative schemes in most conditions.
UR - http://www.scopus.com/inward/record.url?scp=70449514528&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2009.5206073
DO - 10.1109/ISIT.2009.5206073
M3 - Conference contribution
AN - SCOPUS:70449514528
SN - 9781424443130
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1011
EP - 1015
BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009
T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009
Y2 - 28 June 2009 through 3 July 2009
ER -