Deep Learning-Based Edge Caching in Fog Radio Access Networks

In this article, the edge caching policy in fog radio access networks (F-RANs) is optimized via deep learning. Considering that it is hard for fog access points (F-APs) to collect sufficient data of massive content features, our proposed edge caching policy only utilizes the number of requests and u...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on wireless communications Vol. 19; no. 12; pp. 8442 - 8454
Main Authors Jiang, Yanxiang, Feng, Haojie, Zheng, Fu-Chun, Niyato, Dusit, You, Xiaohu
Format Journal Article
LanguageEnglish
Published New York IEEE 01.12.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:In this article, the edge caching policy in fog radio access networks (F-RANs) is optimized via deep learning. Considering that it is hard for fog access points (F-APs) to collect sufficient data of massive content features, our proposed edge caching policy only utilizes the number of requests and user location. In an offline phase, we propose to learn the corresponding popularity prediction model for every content popularity trend class and user location prediction models to make the popularity prediction accurate, adaptive and targeted. Moreover, we develop a loss function to avoid overfitting and increase sensitivity to high popularity for popularity prediction models. In an online phase, we propose a reactive caching scheme to react to user requests. In order to guarantee that classification can improve the popularity prediction accuracy in both phases, deep learning and k-Nearest Neighbor (kNN) are combined to classify popularity trends. Besides, a joint proactive-reactive caching policy is proposed to maximize the cache hit rate. The proposed policy is able to promptly track the various popularity trends with spatial-temporal popularity, trend and user dynamics with a low computational complexity. Extensive performance evaluation results show that the cache hit rate of our proposed policy approaches that of the optimal policy.
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2020.3022907