Abstract
In this paper, the cooperative caching problem in fog radio access networks (F-RANs) is investigated. To minimize the content request delay, we formulate the hierarchical cooperative caching optimization problem to find the optimal caching policy. Considering the non-deterministic polynomial hard (NP-hard) property of this problem, we propose a brain storm optimization (BSO) approach which utilizes the penaltybased fitness function in individuals evaluation to meet the storage capacity constraint and the genetic algorithm (GA) in new individuals generation to meet the integer constraint, respectively. To further reduce the computational complexity, we propose to implement the convergent operation in the objective space via individuals classification. Simulation results show that our proposed BSO-based hierarchical cooperative caching policy achieves remarkable performance in minimizing the content request delay.
| Original language | English |
|---|---|
| Article number | 9322173 |
| Journal | Proceedings - IEEE Global Communications Conference, GLOBECOM |
| DOIs | |
| State | Published - 2020 |
| Externally published | Yes |
| Event | 2020 IEEE Global Communications Conference, GLOBECOM 2020 - Virtual, Taipei, Taiwan, Province of China Duration: 7 Dec 2020 → 11 Dec 2020 |
Keywords
- Fog radio access networks
- brain storm optimization.
- content request delay
- hierarchical cooperative caching
Fingerprint
Dive into the research topics of 'Hierarchical Cooperative Caching in Fog Radio Access Networks: A Brain Storm optimization Approach'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver