Caching-aided coded multicasting in dynamic scenarios
Mirna Haidar, Yasser Fadlallah, Hadi E. Sawaya, Abed Ellatif Samhat · 2023
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, the focus is on designing an adaptive coded caching schema in dynamic scenarios with respect to the users mobility and their continuous requests. The proposed technique is based on the original coded caching schema that can be seen as index coding problem and modeled as a conflict graph. The approach is to adapt the conflict graph to any request and apply the necessary coloring in a adaptive way. A greedy approach is used, comparing the performance to the Greedy Randomized Adaptive Search Procedure (GRASP) algorithm proposed by Vettigli et al.. The aim of the adaptive greedy based technique is improving the performance while significantly reducing the complexity of the algorithm. Simulation results highlight the performance of the proposed technique.