Joint Successful Transmission Probability, Delay, and Energy Efficiency Caching Optimization in Fog Radio Access Network
| Autor: | Mhd Nour Hindia, Kaharudin Dimyati, Wei Ru Wong, Tengku Faiz Tengku Mohmed Noor Izam, Alaa Bani-Bakr |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Mathematical optimization
Optimization problem TK7800-8360 delay Computer Networks and Communications Computer science stochastic geometry 02 engineering and technology F-RAN caching 0203 mechanical engineering 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering Cuckoo search energy efficiency Radio access network backhaul 020206 networking & telecommunications 020302 automobile design & engineering Hardware and Architecture Control and Systems Engineering Signal Processing Benchmark (computing) cuckoo search algorithm Cache Enhanced Data Rates for GSM Evolution fog computing Electronics Performance improvement Stochastic geometry |
| Zdroj: | Electronics, Vol 10, Iss 1847, p 1847 (2021) Electronics Volume 10 Issue 15 |
| ISSN: | 2079-9292 |
| DOI: | 10.3390/electronics10151847 |
| Popis: | The fog radio access network (F-RAN) is considered an efficient architecture for caching technology as it can support both edge and centralized caching due to the backhauling of the fog access points (F-APs). Successful transmission probability (STP), delay, and energy efficiency (EE) are key performance metrics for F-RAN. Therefore, this paper proposes a proactive cache placement scheme that jointly optimizes STP, delay, and EE in wireless backhauled cache-enabled F-RAN. First, expressions of the association probability, STP, average delay, and EE are derived using stochastic geometry tools. Then, the optimization problem is formulated to obtain the optimal cache placement that maximizes the weighted sum of STP, EE, and negative delay. To solve the optimization problem, this paper proposes the normalized cuckoo search algorithm (NCSA), which is a novel modified version of the cuckoo search algorithm (CSA). In NCSA, after generating the solutions randomly via Lévy flight and random walk, a simple bound is applied, and then the solutions are normalized to assure their feasibility. The numerical results show that the proposed joint cache placement scheme can effectively achieve significant performance improvement by up to 15% higher STP, 45% lower delay, and 350% higher EE over the well-known benchmark caching schemes. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|