To refer to this page use:
|Abstract:||A heterogenous network with base stations (BSs), small base stations (SBSs), and users distributed according to independent Poisson point processes is considered. SBS nodes are assumed to possess high storage capacity and to form a distributed caching network. Popular files are stored in local caches of SBSs, so that a user can download the desired files from one of the SBSs in its vicinity. The offloading-loss is captured via a cost function that depends on the random caching strategy proposed here. The popularity profile of cached content is unknown and estimated using instantaneous demands from users within a specified time interval. An estimate of the cost function is obtained from which an optimal random caching strategy is devised. The training time to achieve an ∈ > 0 difference between the achieved and optimal costs is finite provided the user density is greater than a predefined threshold, and scales as N 2 , where N is the support of the popularity profile. A transfer learning-based approach to improve this estimate is proposed. The training time is reduced when the popularity profile is modeled using a parametric family of distributions; the delay is independent of N and scales linearly with the dimension of the distribution parameter.|
|Citation:||Bharath, B. N., Kyatsandra G. Nagananda, and H. Vincent Poor. "A learning-based approach to caching in heterogenous small cell networks." IEEE Transactions on Communications 64, no. 4 (2016): 1674-1686. doi:10.1109/TCOMM.2016.2536728|
|Pages:||1674 - 1686|
|Type of Material:||Journal Article|
|Journal/Proceeding Title:||IEEE Transactions on Communications|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.