Stochastic geometry model for multi-channel fog radio access networks

IEEE Trans. Wireless Commun.

et al. 2018

Self Cite

Cache-enabled small base station (SBS) densification is foreseen as a key component of 5G cellular networks. This architecture enables storing popular files at the network edge (i.e., SBS caches), which empowers local communication and alleviates traffic congestions at the core/backhaul network. This paper develops a mathematical framework, based on stochastic geometry, to characterize the hit probability in a multi-channel cache-enabled 5G networks with both unicast/multicast capabilities and opportunistic spectrum access. To this end, we first derive the hit probability by characterizing the opportunistic spectrum access success probabilities, service distance distributions, and coverage probabilities. An optimization framework for file caching is then developed to maximize this hit probability. To this end, a simple concave approximation for the hit probability is proposed, which highly reduces the optimization complexity and leads to a closed-form solution. The sub-optimal solution is benchmarked against two widely employed caching distribution schemes, namely uniform and Zipf caching, through numerical results and extensive simulations. It is shown that the caching strategy should be adapted to the network parameters and capabilities. For instance, diversifying file caching according to the Zipf distribution is better in multicast systems with large number of channels. However, when the number of channels is low and/or the network is restricted to unicast transmissions, it is better to confine the caching to the most popular files only.

Section: Introductionmentioning

confidence: 99%

Optimal Caching in 5G Networks With Opportunistic Spectrum Access

IEEE Trans. Wireless Commun.

et al. 2018

Self Cite

“…For caching systems, optimal file placement that maximizes the probability that requested files are retrieved from the BSs' caches, denoted as the hit probability, is derived in [12]- [14]. The performance gain due to opportunistic spectrum access in cache enabled network is characterized in [15], [16]. However, none of [12]- [16] studies caching in mmW networks.…”

Section: Introductionmentioning

confidence: 99%

“…The performance gain due to opportunistic spectrum access in cache enabled network is characterized in [15], [16]. However, none of [12]- [16] studies caching in mmW networks. The authors in [17], [18] and [19] study caching in mmW networks when, respectively, all BSs and a fraction of BSs are cache enabled.…”

Section: Introductionmentioning

confidence: 99%

Flexible Design of Millimeter-Wave Cache Enabled Fog Networks

2018 IEEE Globecom Workshops (GC Wkshps)

et al. 2018

Self Cite

Ultra-densification, millimeter wave (mmW) communications, and proactive network-edge caching, utilized within mmW fog networks (mmFNs), are foreseen to provide tangible gains for broadband access, network capacity, and latency. However, caching implementation in mmFN imposes high capital expenditure (CAPEX) due to the ultra-high density of base stations (BSs). For a given caching CAPEX, it may be more efficient to install higher capacity caches in a fraction of the BSs than installing smaller capacity caches in every BSs. In the former case, wireless self-backhauling of mmW systems can be exploited to share the cache contents stored in a given cache enabled BSs (CE-BSs) with other BSs in the network. In this regards, this paper develops a mathematical model, based on stochastic geometry, to study the tradeoff between the cache size and intensity of CE-BSs on the probability that requested popular contents are retrieved from the network edge, denoted as the hit probability. Assuming a power-law inverse relationship between the cache size and intensity of CE-BSs, an optimization problem is formulated and solved for the intensity of CE-BSs and probabilistic file placement in caches such that the hit probability is maximized. The results show that neither installing small caches in every BS nor having sufficiently high capacity caches (i.e., that confine all popular files) installed in small number of BSs exploit the full potential of mmFN. Instead, there exists an optimal balance between the cache size and intensity of CE-BSs, which depends on the network parameters such as the applied caching strategy, required rate, total intensity of BSs, popular content distribution, and cache size/intensity relationship.

“…However, [8] follows a rigid frequency reuse scheme, which is well-known to underutilize the spectrum resources [9]. In [10], we analyzed the performance of cache-enabled networks with opportunistic spectrum access in a multi-channel environment. However, [10] considers a single-user unicast scenario.…”

Section: Introductionmentioning

confidence: 99%

“…In [10], we analyzed the performance of cache-enabled networks with opportunistic spectrum access in a multi-channel environment. However, [10] considers a single-user unicast scenario.…”

Section: Introductionmentioning

confidence: 99%

Optimal Caching in Multicast 5G Networks with Opportunistic Spectrum Access

GLOBECOM 2017 - 2017 IEEE Global Communications Conference

et al. 2017

Self Cite

Cache-enabled small base station (SBS) densification is foreseen as a key component of 5G cellular networks. This architecture enables storing popular files at the network edge (i.e., SBS caches), which empowers local communication and alleviates traffic congestions at the core/backhaul network. This paper develops a mathematical framework, based on stochastic geometry, to characterize the hit probability of a cache-enabled multicast 5G network with SBS multi-channel capabilities and opportunistic spectrum access. To this end, we first derive the hit probability by characterizing opportunistic spectrum access success probabilities, service distance distributions, and coverage probabilities. The optimal caching distribution to maximize the hit probability is then computed. The performance and trade-offs of the derived optimal caching distributions are then assessed and compared with two widely employed caching distribution schemes, namely uniform and Zipf caching, through numerical results and extensive simulations. It is shown that the Zipf caching almost optimal only in scenarios with large number of available channels and large cache sizes.