Cooperative Edge Caching in Fog Radio Access Networks

In this paper, the cooperative edge caching problem in fog radio access networks (F-RANs) is investigated to minimize the average download delay. Considering the non-linear and coupled multi-variable nature of the original optimizing problem, we transform it into an equivalent integer linear programming problem with decoupled variables. Then, we decomposed the transformed problem into two subproblems which can be solved separately by each fog access point (F-AP). Considering the non-deterministic polynomial hard (NP-hard) nature of the two decomposed subproblems, we propose an improved pigeon inspired optimization (PIO) based cooperative edge caching scheme, which utilizes Cauchy perturbation and self-adaptive factor to avoid pre-mature convergence and achieve a better search performance, respectively. Our proposed scheme not only allows F-APs to make cache decisions with low computational complexity, but also has very low message passing overhead. Simulation results show that our proposed scheme can greatly decrease the average download delay.