A Learning-Based Approach to Caching in Heterogenous Small Cell Networks

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 $\epsilon>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.Comment: 12 pages, 5 figures, published in IEEE Transactions on Communications, 2016. arXiv admin note: text overlap with arXiv:1504.0363

Caching with Unknown Popularity Profiles in Small Cell Networks

A heterogenous network is considered where the base stations (BSs), small base stations (SBSs) and users are distributed according to independent Poisson point processes (PPPs). We let the SBS nodes to posses high storage capacity and are assumed to form a distributed caching network. Popular data files are stored in the local cache of SBS, so that users can download the desired files from one of the SBS in the vicinity subject to availability. The offloading-loss is captured via a cost function that depends on a random caching strategy proposed in this paper. The cost function depends on the popularity profile, which is, in general, unknown. In this work, the popularity profile is estimated at the BS using the available instantaneous demands from the users in a time interval $[0,\tau]$. This is then used to find an estimate of the cost function from which the optimal random caching strategy is devised. The main results of this work are the following: First it is shown that the waiting time $\tau$ to achieve an $\epsilon>0$ difference between the achieved and optimal costs is finite, provided the user density is greater than a predefined threshold. In this case, $\tau$ is shown to scale as $N^2$, where $N$ is the support of the popularity profile. Secondly, a transfer learning-based approach is proposed to obtain an estimate of the popularity profile used to compute the empirical cost function. A condition is derived under which the proposed transfer learning-based approach performs better than the random caching strategy.Comment: 6 pages, Proceedings of IEEE Global Communications Conference, 201

Crowd Counting Through Walls Using WiFi

Counting the number of people inside a building, from outside and without entering the building, is crucial for many applications. In this paper, we are interested in counting the total number of people walking inside a building (or in general behind walls), using readily-deployable WiFi transceivers that are installed outside the building, and only based on WiFi RSSI measurements. The key observation of the paper is that the inter-event times, corresponding to the dip events of the received signal, are fairly robust to the attenuation through walls (for instance as compared to the exact dip values). We then propose a methodology that can extract the total number of people from the inter-event times. More specifically, we first show how to characterize the wireless received power measurements as a superposition of renewal-type processes. By borrowing theories from the renewal-process literature, we then show how the probability mass function of the inter-event times carries vital information on the number of people. We validate our framework with 44 experiments in five different areas on our campus (3 classrooms, a conference room, and a hallway), using only one WiFi transmitter and receiver installed outside of the building, and for up to and including 20 people. Our experiments further include areas with different wall materials, such as concrete, plaster, and wood, to validate the robustness of the proposed approach. Overall, our results show that our approach can estimate the total number of people behind the walls with a high accuracy while minimizing the need for prior calibrations.Comment: 10 pages, 14 figure