Wireless caching brings network content close to mobile users (MU), and has been identified as an effective solution for reducing MUs’ transmission delay. In this paper, we concentrate on how to efficiently allocate network files to the storage of pico-cells and associate MUs with the pico-cells. To deal with the series of resource allocation problems, we first separate these problems as two distinct many-to-one matching games. Then, we tackle these problems by proposing different concepts to generate the preference lists respectively. The deferred-acceptance algorithm is designed in this paper to achieve stable matchings in these two separated games. It is shown in numerical results that our proposed design demonstrates a better performance compared to state-of-the-art benchmarks.
CITATION STYLE
Shi, G., Li, J., Zhang, H., Shu, F., & Liu, T. (2018). Two-Tier Matching Game Design for Wireless Caching in Pico-Cell Networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 211, pp. 663–674). Springer Verlag. https://doi.org/10.1007/978-3-319-72823-0_61
Mendeley helps you to discover research relevant for your work.