Probabilistic Small-Cell Caching: Performance Analysis and Optimization
- 7 September 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 66 (00189545) , 1
Abstract
Small-cell caching utilizes the embedded storage of small-cell base stations (SBSs) to store popular contents for the sake of reducing duplicated content transmissions in networks and for offloading the data traffic from macrocell base stations to SBSs. In this paper, we study a probabilistic small-cell caching strategy, where each SBS caches a subset of contents with a specific caching probability. We consider two kinds of network architectures: 1) The SBSs are always active, which is referred to as the always-on architecture; and 2) the SBSs are activated on demand by mobile users (MUs), which is referred to as the dynamic on-off architecture. We focus our attention on the probability that MUs can successfully download content from the storage of SBSs. First, we derive theoretical results of this successful download probability (SDP) using stochastic geometry theory. Then, we investigate the impact of the SBS parameters, such as the transmission power and deployment intensity on the SDP. Furthermore, we optimize the caching probabilities by maximizing the SDP based on our stochastic geometry analysis. The intrinsic amalgamation of optimization theory and stochastic geometry based analysis leads to our optimal caching strategy, characterized by the resultant closed-form expressions. Our results show that in the always-on architecture, the optimal caching probabilities solely depend on the content request probabilities, while in the dynamic on-off architecture, they also relate to the MU-to-SBS intensity ratio. Interestingly, in both architectures, the optimal caching probabilities are linear functions of the square root of the content request probabilities. Monte-Carlo simulations validate our theoretical analysis and show that the proposed schemes relying on the optimal caching probabilities are capable of achieving substantial SDP improvement, compared with the benchmark schemes.Keywords
Funding Information
- European Research Council (advanced fellow grant - beam me up)
- Engineering and Physical Sciences Research Council (EP/Noo4558/1 and EP/L018659/1)
- Royal Society (wolfson research merit award)
This publication has 26 references indexed in Scilit:
- Analysis on Cache-Enabled Wireless Heterogeneous NetworksIEEE Transactions on Wireless Communications, 2015
- Wireless Device-to-Device Caching Networks: Basic Principles and System PerformanceIEEE Journal on Selected Areas in Communications, 2015
- Mobile device-to-device (D2D) content delivery networking: A design and optimization frameworkJournal of Communications and Networks, 2014
- Approximation Algorithms for Mobile Data Caching in Small Cell NetworksIEEE Transactions on Communications, 2014
- Base-Station Assisted Device-to-Device Communications for High-Throughput Wireless Video NetworksIEEE Transactions on Wireless Communications, 2014
- Fundamental Limits of CachingIEEE Transactions on Information Theory, 2014
- Nonlinear Programming2013
- Femtocaching and device-to-device collaboration: A new architecture for wireless video distributionIEEE Communications Magazine, 2013
- Coverage and Economy of Cellular Networks with Many Base StationsIEEE Communications Letters, 2012
- Algorithm 715: SPECFUN–a portable FORTRAN package of special function routines and test driversACM Transactions on Mathematical Software, 1993