Mobility-Aware Content Caching Using Graph-Coloring

Caching the popular files in the memories of small base stations (SBSs) is an effective solution to the limited capacity of wireless backhaul links. The efficiency of caching depends on the proper design of the content placement. This is more challenging when the SBSs have overlapped coverage and especially when the users are also mobile. In this letter, we exploit the concept of graph-coloring and model the connection between SBSs and users as well as user mobilities, through a weighted graph in which SBSs are its vertices, and propose some algorithms to color it effectively. Then, we fill the memory of colored SBSs with popular content accordingly.

Automated summary

This letter discusses the effectiveness of caching popular files in the memories of small base stations to address capacity limitations of wireless backhaul links. By utilizing graph-coloring and algorithms, the connection between SBSs and users, as well as user mobilities, can be effectively modeled and content placement optimized.