Resource Allocation for Multi-Antenna Coded Caching Systems With Dynamic User Behavior

被引:0
作者
Abolpour, Milad [1 ]
Salehi, Mohammadjavad [1 ]
Tolli, Antti [1 ]
机构
[1] Univ Oulu, Ctr Wireless Commun, Oulu 90570, Finland
基金
芬兰科学院;
关键词
Space division multiplexing; Vectors; Array signal processing; Resource management; MISO communication; Signal to noise ratio; Libraries; Coded caching; shared caching; dynamic networks; uneven subpacketization; multi-antenna communications;
D O I
10.1109/LWC.2024.3404137
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In practical cache-aided setups, users may enter or depart the network at any time. The shared caching model can mitigate the detrimental impact of such dynamic user behavior by assigning users to a limited set of caching profiles. In this letter, we propose a highly effective data delivery strategy relying on an uneven subpacketization process to improve the finite-SNR performance of dynamic networks. In order to maximize the utilization of available spatial degrees of freedom, the number of serving users per transmission is fixed to the maximal value, resulting in a larger number of transmissions for users assigned to caching profiles with smaller user counts. Consequently, users assigned to different profiles may receive a varying portion of their requested files in each transmission. To facilitate the efficient delivery of unequal-sized data, an iterative beamformer design given a variable rate allocation per user is also devised. Numerical results demonstrate that the performance of the proposed method is always superior to unicasting and other existing coded caching approaches.
引用
收藏
页码:2160 / 2164
页数:5
相关论文
共 20 条
  • [1] Cache-Aided Communications in MISO Networks With Dynamic User Behavior
    Abolpour, Milad
    Salehi, Mohammadjavad
    Tolli, Antti
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2024, 23 (10) : 12670 - 12686
  • [2] Coded Caching and Spatial Multiplexing Gain Trade-off in Dynamic MISO Networks
    Abolpour, Milad
    Salehi, Mohammad Javad
    Tolli, Antti
    [J]. 2022 IEEE 23RD INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATION (SPAWC), 2022,
  • [3] Subexponential and Linear Subpacketization Coded Caching via Projective Geometry
    Chittoor, Hari Hara Suthan
    Krishnan, Prasad
    Sree, K. V. Sushena
    Mamillapalli, Bhavana
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (09) : 6193 - 6222
  • [4] A New Order-Optimal Decentralized Coded Caching Scheme With Good Performance in the Finite File Size Regime
    Jin, Sian
    Cui, Ying
    Liu, Hui
    Caire, Giuseppe
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (08) : 5297 - 5310
  • [5] Adding Transmitters Dramatically Boosts Coded-Caching Gains for Finite File Sizes
    Lampiris, Eleftherios
    Elia, Petros
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2018, 36 (06) : 1176 - 1188
  • [6] Ma Yinbin, 2022, 2022 IEEE International Symposium on Information Theory (ISIT), P1133, DOI 10.1109/ISIT50566.2022.9834866
  • [7] Fundamental Limits of Caching
    Maddah-Ali, Mohammad Ali
    Niesen, Urs
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (05) : 2856 - 2867
  • [8] Mahmoodi HB, 2022, IEEE ICC, P5165, DOI 10.1109/ICC45855.2022.9838415
  • [9] Parrinello E, 2020, IEEE INT SYMP INFO, P1675, DOI [10.1109/ISIT44484.2020.9174374, 10.1109/isit44484.2020.9174374]
  • [10] Fundamental Limits of Coded Caching With Multiple Antennas, Shared Caches and Uncoded Prefetching
    Parrinello, Emanuele
    Unsal, Ayse
    Elia, Petros
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (04) : 2252 - 2268