Journal
IEEE TRANSACTIONS ON COMMUNICATIONS
Volume 68, Issue 2, Pages 1087-1100Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCOMM.2019.2956041
Keywords
Predictive models; Base stations; Computational modeling; Analytical models; Wireless communication; Computational complexity; Minimization; Linear prediction; caching; Poisson point process (PPP); online learning
Funding
- UK Engineering and Physical Sciences Research Council (EPSRC) [EP/P009549/1, EP/P009670/1]
- UK-India Education and Research Initiative Thematic Partnerships [DST UKIERI-2016-17-0060, DST/INT/UK/P-129/2016, UGCUKIERI 2016-17-058]
- Heriot-Watt University
- EPSRC [EP/P009549/1, EP/P009670/1] Funding Source: UKRI
Ask authors/readers for more resources
Caching popular contents in advance is an important technique to achieve low latency and reduce the backhaul costs in future wireless communications. Considering a network with base stations distributed as a Poisson point process, optimal content placement caching probabilities are obtained to maximize the average success probability (ASP) for a known content popularity (CP) profile, which in practice is time-varying and unknown in advance. In this paper, we first propose two online prediction (OP) methods for forecasting CP viz., popularity prediction model (PPM) and Grassmannian prediction model (GPM), where the unconstrained coefficients for linear prediction are obtained by solving constrained non-negative least squares. To reduce the higher computational complexity per online round, two online learning (OL) approaches viz., weighted-follow-the-leader and weighted-follow-the-regularized-leader are proposed, inspired by the OP models. In OP, ASP difference (i.e, the gap between the ASP achieved by prediction and that by known content popularity) is bounded, while in OL, sub-linear MSE regret and linear ASP regret bounds are obtained. With MovieLens dataset, simulations verify that OP methods are better for MSE and ASP difference minimization, while the OL approaches perform well for the minimization of the MSE and ASP regrets.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available