TY - JOUR
T1 - Joint Content Caching, Recommendation, and Transmission Optimization for Next Generation Multiple Access Networks
AU - Fu, Yaru
AU - Zhang, Yue
AU - Zhu, Qi
AU - Chen, Mingzhe
AU - Quek, Tony Q.S.
N1 - Funding Information:
This work was supported in part by the Research Grants Council of the Hong Kong Special Administrative Region, China, under Project UGC/FDS16/E09/21; in part by the Hong Kong President's Advisory Committee on Research and Development (PACRD) under Project 2020/1.6; in part by the National Natural Science Foundation of China (NSFC) under Grant 61971239 and Grant 61771427; in part by the Scientific Research Foundation for Talents of Shantou University under Grant NTF21039; and in part by the National Research Foundation, Singapore, and Infocomm Media Development Authority under its Future Communications Research and Development Program.
Publisher Copyright:
© 2022 IEEE.
PY - 2022/5/1
Y1 - 2022/5/1
N2 - In this paper, we exploit a behavior-shaping proactive mechanism, namely, recommendation, in cache-assisted non-orthogonal multiple access (NOMA) networks, aiming at minimizing the average system's latency. Thereof, the considered latency consists of two parts, i.e., the backhaul link transmission delay and the content delivery latency. Towards this end, we first examine the expression of system latency, demonstrating how it is critically determined by content cache placement, personalized recommendation, and delivery associated NOMA user pairing and power control strategies. Thereafter, we formulate the minimization problem mathematically taking into account the cache capacity budget, the recommendation-oriented requirements, and the total transmit power constraint, which is a non-convex, multi-timescale, and mixed-integer programming problem. To facilitate the process, we put forth an entirely new paradigm named divide-and-rule. Specifically, we first solve the short-term optimization problem regarding user pairing as well as power allocation and the long-term decision-making problem with respect to recommendation and caching, respectively. On this basis, an iterative algorithm is developed to optimize all the optimization variables alternately. Particularly, for solving the short-timescale problem, graph theory enabled NOMA user grouping and efficient inter-group power control manners are invoked. Meanwhile, a dynamic programming approach and a complexity-controllable swap-then-compare method with convergence insurance are designed to derive the caching and recommendation policies, respectively. From Monte-Carlo simulation, we show the superiority of the proposed joint optimization method in terms of both system latency and cache hit ratio when compared to extensive benchmark strategies.
AB - In this paper, we exploit a behavior-shaping proactive mechanism, namely, recommendation, in cache-assisted non-orthogonal multiple access (NOMA) networks, aiming at minimizing the average system's latency. Thereof, the considered latency consists of two parts, i.e., the backhaul link transmission delay and the content delivery latency. Towards this end, we first examine the expression of system latency, demonstrating how it is critically determined by content cache placement, personalized recommendation, and delivery associated NOMA user pairing and power control strategies. Thereafter, we formulate the minimization problem mathematically taking into account the cache capacity budget, the recommendation-oriented requirements, and the total transmit power constraint, which is a non-convex, multi-timescale, and mixed-integer programming problem. To facilitate the process, we put forth an entirely new paradigm named divide-and-rule. Specifically, we first solve the short-term optimization problem regarding user pairing as well as power allocation and the long-term decision-making problem with respect to recommendation and caching, respectively. On this basis, an iterative algorithm is developed to optimize all the optimization variables alternately. Particularly, for solving the short-timescale problem, graph theory enabled NOMA user grouping and efficient inter-group power control manners are invoked. Meanwhile, a dynamic programming approach and a complexity-controllable swap-then-compare method with convergence insurance are designed to derive the caching and recommendation policies, respectively. From Monte-Carlo simulation, we show the superiority of the proposed joint optimization method in terms of both system latency and cache hit ratio when compared to extensive benchmark strategies.
UR - http://www.scopus.com/inward/record.url?scp=85124230491&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85124230491&partnerID=8YFLogxK
U2 - 10.1109/JSAC.2022.3146901
DO - 10.1109/JSAC.2022.3146901
M3 - Article
AN - SCOPUS:85124230491
VL - 40
SP - 1600
EP - 1614
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
SN - 0733-8716
IS - 5
ER -