ITMMIVJul 6, 2018

Delay-Aware Coded Caching for Mobile Users

arXiv:1807.02548v12 citations
Originality Incremental advance
AI Analysis

This work addresses delay optimization for mobile users in wireless networks, presenting incremental improvements to existing coded caching methods.

The paper tackles the trade-off between cache capacity and user delay in a cooperative small base station coded caching system with mobile users, introducing a delay-aware policy that minimizes average rebuffering delay under cache constraints and another policy that minimizes data served by a macro-cell base station under delay constraints.

In this work, we study the trade-off between the cache capacity and the user delay for a cooperative Small Base Station (SBS) coded caching system with mobile users. First, a delay-aware coded caching policy, which takes into account the popularity of the files and the maximum re-buffering delay to minimize the average rebuffering delay of a mobile user under a given cache capacity constraint is introduced. Subsequently, we address a scenario where some files are served by the macro-cell base station (MBS) when the cache capacity of the SBSs is not sufficient to store all the files in the library. For this scenario, we develop a coded caching policy that minimizes the average amount of data served by the MBS under an average re-buffering delay constraint.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes