Cache Placement Phase Based on Graph Coloring

Data traffic is increasing in recent years and small cell densification is a promising solution for handling the consequences of this growth. However, it faces with backhual’ constraint which limits its efficiency. Caching the popular files near to the small base stations (SBSs) is an effective technique which decreases usage of backhual links. In this paper, we model the network by a graph and propose a new popular files’ placement based on graph coloring for which different powerful solutions and algorithms have been presented in the literature. In this respect, we propose an algorithm to fill the caches of SBSs with the popular files and show the efficiency of our proposed algorithm through simulations.