Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
