z-logo
open-access-imgOpen Access
Non‐orthogonal multiple access relaying with truncated ARQ
Author(s) -
Yu Zhiyuan,
Zhai Chao,
Liu Ju
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.0650
Subject(s) - retransmission , relay , computer science , decoding methods , hybrid automatic repeat request , automatic repeat request , throughput , computer network , sliding window protocol , selective repeat arq , interference (communication) , real time computing , power (physics) , algorithm , telecommunications , wireless , telecommunications link , channel (broadcasting) , network packet , physics , quantum mechanics , window (computing) , operating system
In this study, the authors propose a non‐orthogonal multiple access (NOMA) relaying protocol with truncated automatic repeat request (ARQ), where the source simultaneously transmits two signals to the relay and the destination using superposition coding technique in the power domain. The successive interference cancelation technique is adopted by the relay, who should first decode its own data and then cancel it for the decoding of destination data. If either the data intended for the relay or the destination is erroneously received by the relay, it will be retransmitted by the source using full power. After correctly decoding the source data intended for the destination, the relay will forward it and the retransmission is performed when the data is erroneously received by the destination. The authors derive the system throughput and investigate the impacts of several parameters, such as power allocation factor, target rate, and distance between terminals etc. In terms of throughput, the authors’ proposed scheme can greatly outperform the conventional relaying scheme with truncated ARQ.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here