User Preferences-Based Proactive Content Caching With Characteristics Differentiation in HetNets

With the proliferation of mobile applications, the explosion of mobile data traffic imposes a significant burden on backhaul links with limited capacity in heterogeneous cellular networks (HetNets). To alleviate this challenge, content caching based on popularity at Small Base Stations (SBSs) has emerged as a promising solution. However, accurately predicting the file popularity profile for SBSs remains a key challenge due to variations in content characteristics and user preferences. Moreover, factors such as content size and the length of time slots (that is, the time duration of the update cycle for SBSs) critically impact the performance of caching schemes with limited storage capacity. In this paper, a <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</u>ealism-ori<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">e</u>n<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</u>ed <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</u>ntellige<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</u>t c<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">a</u>ching (RETINA) is proposed to address the problem of content caching with unknown file popularity profiles, considering varying content sizes and time slots lengths. Our simulation results demonstrate that RETINA can significantly enhance the cache hit rate by 4%–12% compared to existing content caching schemes.