Social-aware Cooperative Caching in Fog Radio Access Networks
Baotian Fan, Yanxiang Jiang, Fu-Chun Zheng, Mehdi Bennis, Xiaohu You

TL;DR
This paper proposes a social-aware cooperative caching scheme in fog radio access networks that leverages social relationships among access points to optimize transmission delay and energy consumption, using clustering and an improved firefly algorithm.
Contribution
It introduces a novel clustering scheme based on hedonic coalition game and an improved firefly algorithm for cooperative caching in F-RANs, addressing NP-hard optimization.
Findings
Reduces content transmission delay
Lowers energy consumption
Outperforms baseline schemes
Abstract
In this paper, the cooperative caching problem in fog radio access networks (F-RANs) is investigated to jointly optimize the transmission delay and energy consumption. Exploiting the potential social relationships among fog access points (F-APs), we firstly propose a clustering scheme based on hedonic coalition game (HCG) to improve the potential cooperation gain. Then, considering that the optimization problem is non-deterministic polynomial hard (NP-hard), we further propose an improved firefly algorithm (FA) based cooperative caching scheme, which utilizes a mutation strategy based on local content popularity to avoid pre-mature convergence. Simulation results show that our proposed scheme can effectively reduce the content transmission delay and energy consumption in comparison with the baselines.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Sharing Economy and Platforms · Cooperative Communication and Network Coding
