CAO-SIR: Channel aware ordered successive relaying

31Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Cooperative communication suffers from multiplexing loss and low spectral efficiency due to the half duplex constraint of relays. To improve the multiplexing gain, successive relaying, which allows concurrent transmission of the source and relays, has been proposed. However, the severe inter-relay interference becomes a key challenge. In this paper, we propose a channel aware successive relaying protocol, also referred to as CAO-SIR, which is capable of thoroughly mitigating inter-relay interference by carefully adapting relays' transmission order and rate. In particular, a relay having a poorer link to the source is scheduled first to forward a message, the data rate of which is adapted to the link quality of the source-relay and relay-destination channels. By this means, each relay may decode the messages intended for the preceding relays, and then cancel these relays' interference in a low complexity which is equal to that of Decision Feedback Equalizer (DFE). To further optimize and analyze CAO-SIR, we present its equivalent parallel relay channel model, based upon which the adaptive relay selection and power allocation schemes are proposed. By employing M half duplex relays, CAO-SIR is capable of achieving an diversity-multiplexing tradeoff (DMT) given by d(r) = max { (M + 1) (1 - M+2/M+1 r), (1 - r) }, where d(r) and r denote the diversity and multiplexing gains, respectively. Its DMT asymptotically approaches the DMT upper bound achieved by (M + 1) x 1 MISO systems or M full duplex relays, when M is large.

Cite

CITATION STYLE

APA

Chen, W. (2014). CAO-SIR: Channel aware ordered successive relaying. IEEE Transactions on Wireless Communications, 13(12), 6513–6527. https://doi.org/10.1109/TWC.2014.2363453

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free