TY - JOUR
T1 - Cooperative buffer-aided relaying using full-duplex relays with flow control
AU - Shin, Yuhyun
AU - Baek, Seung Jun
N1 - Funding Information:
Manuscript received July 8, 2018; revised November 1, 2018; accepted November 30, 2018. Date of publication December 14, 2018; date of current version February 12, 2019. This work was supported by the National Research Foundation of Korea under Grant 2018R1A2B6007130, funded by the Korea Government (Ministry of Science and ICT and Future Planning). The review of this paper was coordinated by Dr. J.-C. Chen. (Corresponding author: Seung Jun Baek.) The authors are with the Department of Computer and Communications Engineering, Korea University, Seoul 130-720, South Korea (e-mail:, shuj1234@korea.ac.kr; sjbaek@korea.ac.kr). Digital Object Identifier 10.1109/TVT.2018.2886753
Publisher Copyright:
© 1967-2012 IEEE.
PY - 2019/2
Y1 - 2019/2
N2 - In this paper, we investigate buffer-aided cooperative relaying schemes using full-duplex (FD) relay nodes with flow control. We show that incorporating various transmission options combined with proper successive interference cancellation can better exploit the opportunism of fading channels, leading to improved achievable rates. We analytically derive the optimal policy for node selection and link scheduling. To deal with the delay incurred at relay nodes, we propose flow control using a threshold-based policy on relays' queues. For performance analysis, we develop a novel technique to derive a delay estimate of the controlled queues with general arrival and service statistics. Numerical results show that the proposed scheme achieves higher throughputs than conventional relaying schemes without FD relaying, and that the proposed estimate closely approximates the actual delay. For the delay-constrained case, our scheme is shown to achieve an improved tradeoff between throughput and delay.
AB - In this paper, we investigate buffer-aided cooperative relaying schemes using full-duplex (FD) relay nodes with flow control. We show that incorporating various transmission options combined with proper successive interference cancellation can better exploit the opportunism of fading channels, leading to improved achievable rates. We analytically derive the optimal policy for node selection and link scheduling. To deal with the delay incurred at relay nodes, we propose flow control using a threshold-based policy on relays' queues. For performance analysis, we develop a novel technique to derive a delay estimate of the controlled queues with general arrival and service statistics. Numerical results show that the proposed scheme achieves higher throughputs than conventional relaying schemes without FD relaying, and that the proposed estimate closely approximates the actual delay. For the delay-constrained case, our scheme is shown to achieve an improved tradeoff between throughput and delay.
KW - Cooperative relaying
KW - diffusion approximation
KW - flow control
KW - scheduling
KW - successive interference cancellation
UR - http://www.scopus.com/inward/record.url?scp=85058903011&partnerID=8YFLogxK
U2 - 10.1109/TVT.2018.2886753
DO - 10.1109/TVT.2018.2886753
M3 - Article
AN - SCOPUS:85058903011
SN - 0018-9545
VL - 68
SP - 1804
EP - 1838
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 2
M1 - 8576607
ER -