TY - JOUR
T1 - Optimal transmission scheduling of cooperative communications with a full-duplex relay
AU - Li, Peng
AU - Guo, Song
AU - Zhuang, Weihua
PY - 2014/9
Y1 - 2014/9
N2 - Most existing research studies in cooperative communication are based on a half-duplex assumption. Motivated by recent successes in hardware implementation of wireless full-duplex transmission, we propose a full-duplex cooperative communication (FDCC) approach to maximize the minimum transmission rate among a set of users to a common destination with the help of a dedicated relay. Under the consideration of hardware cost, only the relay node requires full-duplex wireless equipment in our design. We derive the achievable transmission rate for the proposed FDCC scheme under both amplify-and-forward (AF) and decode-and-forward (DF) modes. Further, as the transmission scheduling of users plays a critical role in determining the achievable transmission rate in FDCC, we formulate the max-min rate scheduling problem as a nonconvex mixed integer nonlinear programming (MINLP) problem. By applying linearization and convex approximation techniques, we propose an optimal algorithm based on a branch-and-bound framework to solve the problem efficiently. Extensive simulation results show that FDCC can significantly improve the transmission rate as compared with direct transmission and half-duplex cooperative communication (HDCC).
AB - Most existing research studies in cooperative communication are based on a half-duplex assumption. Motivated by recent successes in hardware implementation of wireless full-duplex transmission, we propose a full-duplex cooperative communication (FDCC) approach to maximize the minimum transmission rate among a set of users to a common destination with the help of a dedicated relay. Under the consideration of hardware cost, only the relay node requires full-duplex wireless equipment in our design. We derive the achievable transmission rate for the proposed FDCC scheme under both amplify-and-forward (AF) and decode-and-forward (DF) modes. Further, as the transmission scheduling of users plays a critical role in determining the achievable transmission rate in FDCC, we formulate the max-min rate scheduling problem as a nonconvex mixed integer nonlinear programming (MINLP) problem. By applying linearization and convex approximation techniques, we propose an optimal algorithm based on a branch-and-bound framework to solve the problem efficiently. Extensive simulation results show that FDCC can significantly improve the transmission rate as compared with direct transmission and half-duplex cooperative communication (HDCC).
KW - Cooperative communications
KW - full-duplex
KW - scheduling
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:000342179000014
UR - https://openalex.org/W2100655507
UR - https://www.scopus.com/pages/publications/84906226313
U2 - 10.1109/TPDS.2013.206
DO - 10.1109/TPDS.2013.206
M3 - Journal Article
SN - 1045-9219
VL - 25
SP - 2353
EP - 2363
JO - IEEE Transactions on Parallel and Distributed Systems
JF - IEEE Transactions on Parallel and Distributed Systems
IS - 9
M1 - 6579601
ER -