Probabilistic small-cell caching: performance analysis and optimization
Probabilistic small-cell caching: performance analysis and optimization
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 macro-cell 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, 2) the SBSs are activated on demand by mobile users (MUs), referred to as the dynamic on-off architecture. We focus our attention on the probability that MUs can successfully download contents 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 to the benchmark schemes.
1-30
Chen, Youjia
9daeaa05-b641-476a-883f-fa92da02b000
Ding, Ming
e9c86fb2-c1f5-4720-be85-0b56b8f75b3a
Li, Jun
173328aa-1759-4a78-9514-319c5a6ff4b0
Lin, Zihuai
ccf46fdb-cda4-4fbe-9cab-41ba727def88
Mao, Guoqiang
8305c3b6-d8a0-410a-b3af-2ec7ed466a50
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Chen, Youjia
9daeaa05-b641-476a-883f-fa92da02b000
Ding, Ming
e9c86fb2-c1f5-4720-be85-0b56b8f75b3a
Li, Jun
173328aa-1759-4a78-9514-319c5a6ff4b0
Lin, Zihuai
ccf46fdb-cda4-4fbe-9cab-41ba727def88
Mao, Guoqiang
8305c3b6-d8a0-410a-b3af-2ec7ed466a50
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Chen, Youjia, Ding, Ming, Li, Jun, Lin, Zihuai, Mao, Guoqiang and Hanzo, Lajos
(2016)
Probabilistic small-cell caching: performance analysis and optimization.
IEEE Transactions on Vehicular Technology, .
(doi:10.1109/TVT.2016.2606765).
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 macro-cell 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, 2) the SBSs are activated on demand by mobile users (MUs), referred to as the dynamic on-off architecture. We focus our attention on the probability that MUs can successfully download contents 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 to the benchmark schemes.
Text
tvt-hanzo-2606765-proof.pdf
- Accepted Manuscript
More information
Accepted/In Press date: 24 August 2016
e-pub ahead of print date: 7 September 2016
Identifiers
Local EPrints ID: 404079
URI: http://eprints.soton.ac.uk/id/eprint/404079
ISSN: 0018-9545
PURE UUID: 1f28a0e7-4064-4bec-84bd-a20cac13da4e
Catalogue record
Date deposited: 20 Dec 2016 14:19
Last modified: 18 Mar 2024 02:35
Export record
Altmetrics
Contributors
Author:
Youjia Chen
Author:
Ming Ding
Author:
Jun Li
Author:
Zihuai Lin
Author:
Guoqiang Mao
Author:
Lajos Hanzo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics