Power Allocation in Cache-Aided NOMA Systems: Optimization and Deep Reinforcement Learning Approaches
Khai Nguyen Doan, Mojtaba Vaezi, Wonjae Shin, H. Vincent Poor,, Hyundong Shin, and Tony Q. S. Quek

TL;DR
This paper explores cache-aided NOMA systems, proposing optimization and deep reinforcement learning methods for power allocation to improve user fairness and system efficiency without user collaboration.
Contribution
It introduces two novel power allocation approaches—divide-and-conquer and deep reinforcement learning—for cache-aided NOMA systems, enhancing performance and fairness.
Findings
Divide-and-conquer method yields closed-form optimal solutions.
Deep reinforcement learning effectively manages power allocation.
Proposed methods outperform baseline approaches in simulations.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
