New technologies that incorporate affordable storage at the edge, such as caching, are anticipated to facilitate the growth of wireless communication and accommodate increased traffic. In this paper, we address the challenge of adapting the original coded caching scheme to time-varying channels through a low-complexity approach. The approach categorizes graph nodes into two groups: those requiring modifications and those that remain unchanged. When a user's code rate increases, a merge process is applied to the associated graph vertices, while a split process is implemented for users with a decreased code rate. Subsequently, the graph is adaptively colored to facilitate continuous transmission. The efficacy and performance of the proposed scheme are demonstrated through simulation results.
An Adaptive Coded Caching Scheme for Time-Varying Channels
2024-06-24
422113 byte
Conference paper
Electronic Resource
English
Decentralized Asynchronous Coded Caching in Fog-RAN
IEEE | 2018
|Coded caching over realistic and scalable wireless networks
DataCite | 2020
|