TY - JOUR
T1 - Power Allocation in Cache-Aided NOMA Systems
T2 - Optimization and Deep Reinforcement Learning Approaches
AU - Doan, Khai Nguyen
AU - Vaezi, Mojtaba
AU - Shin, Wonjae
AU - Poor, H. Vincent
AU - Shin, Hyundong
AU - Quek, Tony Q.S.
N1 - Funding Information:
This work was supported in part by the U.S. National Science Foundation under Grants CCF-0939370 and CCF-1513915, and in part by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science and ICT (NRF-2019R1C1C1006806). The associate editor coordinating the review of this article and approving it for publication was Y. Liu.
Funding Information:
Manuscript received March 5, 2019; revised July 16, 2019 and September 20, 2019; accepted September 22, 2019. Date of publication October 15, 2019; date of current version January 15, 2020. This work was supported in part by the U.S. National Science Foundation under Grants CCF-0939370 and CCF-1513915, and in part by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science and ICT (NRF-2019R1C1C1006806). The associate editor coordinating the review of this article and approving it for publication was Y. Liu. (Corresponding author: Wonjae Shin.) K. N. Doan is with the Department of Information Systems Technology and Design, Singapore University of Technology and Design, Singapore 487372 (e-mail: nguyenkhai_doan@mymail.sutd.edu.sg).
Publisher Copyright:
© 2019 IEEE.
PY - 2020/1
Y1 - 2020/1
N2 - This work exploits the advantages of two prominent techniques in future communication networks, namely caching and non-orthogonal multiple access (NOMA). Particularly, a system with Rayleigh fading channels and cache-enabled users is analyzed. It is shown that the caching-NOMA combination provides a new opportunity of cache hit which enhances the cache utility as well as the effectiveness of NOMA. Importantly, this comes without requiring users' collaboration, and thus, avoids many complicated issues such as users' privacy and security, selfishness, etc. In order to optimize users' quality of service and, concurrently, ensure the fairness among users, the probability that all users can decode the desired signals is maximized. In NOMA, a combination of multiple messages are sent to users, and the defined objective is approached by finding an appropriate power allocation for message signals. To address the power allocation problem, two novel methods are proposed. The first one is a divide-and-conquer-based method for which closed-form expressions for the optimal resource allocation policy are derived making this method simple and flexible to the system context. The second one is based on deep reinforcement learning method that allows all users to share the full bandwidth. Finally, simulation results are provided to demonstrate the effectiveness of the proposed methods and to compare their performance.
AB - This work exploits the advantages of two prominent techniques in future communication networks, namely caching and non-orthogonal multiple access (NOMA). Particularly, a system with Rayleigh fading channels and cache-enabled users is analyzed. It is shown that the caching-NOMA combination provides a new opportunity of cache hit which enhances the cache utility as well as the effectiveness of NOMA. Importantly, this comes without requiring users' collaboration, and thus, avoids many complicated issues such as users' privacy and security, selfishness, etc. In order to optimize users' quality of service and, concurrently, ensure the fairness among users, the probability that all users can decode the desired signals is maximized. In NOMA, a combination of multiple messages are sent to users, and the defined objective is approached by finding an appropriate power allocation for message signals. To address the power allocation problem, two novel methods are proposed. The first one is a divide-and-conquer-based method for which closed-form expressions for the optimal resource allocation policy are derived making this method simple and flexible to the system context. The second one is based on deep reinforcement learning method that allows all users to share the full bandwidth. Finally, simulation results are provided to demonstrate the effectiveness of the proposed methods and to compare their performance.
KW - Caching
KW - deep learning
KW - deep reinforcement learning
KW - interference cancellation
KW - non-orthogonal multiple access (NOMA)
KW - power allocation
UR - http://www.scopus.com/inward/record.url?scp=85078264214&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85078264214&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2019.2947418
DO - 10.1109/TCOMM.2019.2947418
M3 - Article
AN - SCOPUS:85078264214
SN - 1558-0857
VL - 68
SP - 630
EP - 644
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 1
M1 - 8869815
ER -