Abstract
In this work, we investigate the problem of context-aware
data caching in the heterogeneous small cell networks
(HSCNs) to provide satisfactory to the end-users in
reducing the service latency. In particular, we explore
the storage capability of base stations (BSs) in HSCNs
and propose a data caching model consists of edge caching
elements (CAEs), small cell base stations (SBSs), and
macro cell BS (MBS). Then, we concentrate on how to
efficiently match the data contents to the different
cache entities in order to minimize the overall system
service latency. We model it as a distributed college
admission (CA) stable matching problem and tackle this
issue by utilizing contextual information to generate the
preference lists of cache entities and contents,
respectively. In the CA model, we leverage the
resident-oriented Gale-Shapley (RGS) algorithm to find a
stable matching between the contents and the cache
entities. Through numerical results, we illustrate the
advantages of of our proposed methods.
Original language | English |
---|---|
Title of host publication | Communications (ICC), 2016 IEEE International Conference on |
Publisher | IEEE Institute of Electrical and Electronic Engineers |
Pages | 1-6 |
ISBN (Electronic) | 978-1-4799-6664-6 |
ISBN (Print) | 978-1-4799-6665-3 |
DOIs | |
Publication status | Published - 14 Jul 2016 |
MoE publication type | A4 Article in a conference publication |
Event | IEEE International Conference on Communications, ICC 2016: Communications for All Things - Kuala Lumpur, Malaysia Duration: 23 May 2016 → 27 May 2016 |
Conference
Conference | IEEE International Conference on Communications, ICC 2016 |
---|---|
Abbreviated title | ICC 2016 |
Country/Territory | Malaysia |
City | Kuala Lumpur |
Period | 23/05/16 → 27/05/16 |
Keywords
- matching
- small cell networks
- context aware
- content caching