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 es...
Saved in:
Published in | IEEE transactions on vehicular technology Vol. 71; no. 5; pp. 5666 - 5670 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.05.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISSN: | 0018-9545 1939-9359 |
DOI: | 10.1109/TVT.2022.3156528 |