TY - JOUR
T1 - Latency Minimization for Advanced RSMA-Enabled Wireless Caching Networks
AU - Hua, Yu
AU - Fu, Yaru
AU - Zhu, Qi
N1 - Publisher Copyright:
© 2012 IEEE.
PY - 2023/8/1
Y1 - 2023/8/1
N2 - The collaboration between wireless edge caching and rate splitting multiple access (RSMA) can significantly reduce the perceived latency of users. In this letter, an advanced RSMA transmission scheme is proposed with the consideration of users' content requests. In traditional RSMA, multiple replicas of the same messages are transmitted when users request the same contents, which cause the redundant interference. The advanced RSMA is proposed to reduce such redundant interference. Based on the newly designed transmission paradigm, we investigate the joint cache placement and RSMA resource management problem, aiming to minimize the average latency of all users. The formulated problem is a non-convex mixed-integer nonlinear programming (MINLP) problem. By leveraging its structural features, we decompose the original minimization problem into two types of subproblems, i.e., the long-term caching decision problem and the short-term RSMA resource allocation problem. The caching decision problem is tackled by the dynamic programming approach. Whilst the RSMA resource allocation problem is solved by an alternating optimization method with one-dimensional search. Extensive simulation results validate the superiority of our proposed scheme compared to various benchmark strategies.
AB - The collaboration between wireless edge caching and rate splitting multiple access (RSMA) can significantly reduce the perceived latency of users. In this letter, an advanced RSMA transmission scheme is proposed with the consideration of users' content requests. In traditional RSMA, multiple replicas of the same messages are transmitted when users request the same contents, which cause the redundant interference. The advanced RSMA is proposed to reduce such redundant interference. Based on the newly designed transmission paradigm, we investigate the joint cache placement and RSMA resource management problem, aiming to minimize the average latency of all users. The formulated problem is a non-convex mixed-integer nonlinear programming (MINLP) problem. By leveraging its structural features, we decompose the original minimization problem into two types of subproblems, i.e., the long-term caching decision problem and the short-term RSMA resource allocation problem. The caching decision problem is tackled by the dynamic programming approach. Whilst the RSMA resource allocation problem is solved by an alternating optimization method with one-dimensional search. Extensive simulation results validate the superiority of our proposed scheme compared to various benchmark strategies.
KW - Edge caching
KW - RSMA
KW - latency minimization
KW - power control
UR - http://www.scopus.com/inward/record.url?scp=85159794970&partnerID=8YFLogxK
U2 - 10.1109/LWC.2023.3273225
DO - 10.1109/LWC.2023.3273225
M3 - Article
AN - SCOPUS:85159794970
SN - 2162-2337
VL - 12
SP - 1329
EP - 1333
JO - IEEE Wireless Communications Letters
JF - IEEE Wireless Communications Letters
IS - 8
ER -