Mobility-aware coded-caching scheme for small cell network

刘拓ICC

LANGUAGE    English

SOURCE  IEEE ICC 2017, Paris, May 21-25, 2017

Published Date:2017

ABSTRACT

To deal with the huge traffic demand in wireless
networks, small base stations (SBSs) are introduced in cellular
networks, not only with dense deployment, but also with caching
capabilities. Due to the short distances between users and SBSs,
files can be downloaded at higher transmission rate from the
cache of SBSs than being downloaded over backhaul links.
However, user mobility makes the file allocation in SBS caches
more challenging, mostly because the user association to SBSs
dynamically changes. Moreover, the amount of data that users
can download depends on the sojourn time within the coverage of
SBSs. In this paper, based on the assumption that the user sojourn
time obeys exponential distribution, we get the upper bound of
the mean download time of files. A file allocation strategy is then
proposed based on the derived bounds of mean sojourn time.
Optimal file allocation strategies under low and high mobility
are further obtained. Simulations show that the strategy performs
notably better than the popularity-based allocation strategy.

This entry was posted in Publications and tagged . Bookmark the permalink.

Leave a Reply