University of Oulu

Y. Jiang, X. Cui, M. Bennis, F. Zheng, B. Fan and X. You, "Cooperative caching in fog radio access networks: a graph-based approach," in IET Communications, vol. 13, no. 20, pp. 3519-3528, 19 12 2019, https://doi.org/10.1049/iet-com.2019.0436

Cooperative caching in fog radio access networks : a graph-based approach

Saved in:
Author: Jiang, Yanxiang1,2,3; Cui, Xiaoting1; Bennis, Mehdi4;
Organizations: 1National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, People's Republic of China
2State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an 710071, People's Republic of China
3Key Laboratory of Wireless Sensor Network and Communication, Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, 865 Changning Road, Shanghai 200050, People's Republic of China
4Centre for Wireless Communications, University of Oulu, Oulu 90014, Finland
5School of Electronic and Information Engineering, Harbin Institute of Technology, Shenzhen 518055, People's Republic of China
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 1.1 MB)
Persistent link: http://urn.fi/urn:nbn:fi-fe2020050424813
Language: English
Published: Institution of Electrical Engineers, 2019
Publish Date: 2020-05-04
Description:

Abstract

In this study, cooperative caching is investigated in fog radio access networks. To maximise the offloaded traffic, a cooperative caching optimisation problem is formulated. By analysing the relationship between clustering and cooperation and utilising the solutions of the knapsack problems, the above challenging optimisation problem is transformed into a clustering subproblem and a content placement subproblem. To further reduce complexity, the authors propose an effective graph-based approach to solve the two subproblems. In the graph-based clustering approach, a node graph and a weighted graph are constructed. By setting the weights of the vertices of the weighted graph to be the incremental offloaded traffics of their corresponding complete subgraphs, the objective cluster sets can be readily obtained by using an effective greedy algorithm to search for the max-weight independent subset. In the graph-based content placement approach, a redundancy graph is constructed by removing the edges in the complete subgraphs of the node graph corresponding to the obtained cluster sets. Furthermore, they enhance the caching decisions to ensure each duplicate file is cached only once. Compared with traditional approximate solutions, their proposed graph-based approach has lower complexity. Simulation results show remarkable improvements in terms of offloaded traffic by using the proposed approach.

see all

Series: IET Communications
ISSN: 1751-8628
ISSN-E: 1751-8636
ISSN-L: 1751-8628
Volume: 13
Issue: 20
Pages: 3519 - 3528
DOI: 10.1049/iet-com.2019.0436
OADOI: https://oadoi.org/10.1049/iet-com.2019.0436
Type of Publication: A1 Journal article – refereed
Field of Science: 213 Electronic, automation and communications engineering, electronics
Subjects:
Funding: This work was supported in part by the Natural Science Foundation of China under grant no. 61971129, the Natural Science Foundation of Jiangsu Province under grant no. BK20181264, the Research Fund of the State Key Laboratory of Integrated Services Networks (Xidian University) under grant no. ISN19-10, the Research Fund of the Key Laboratory of Wireless Sensor Network and Communication (Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences) under grant no. 2017002, the National Basic Research Program of China (973 Program) under grant no. 2012CB316004, and the U.K. Engineering and Physical Sciences Research Council under grant no. EP/K040685/2.
Copyright information: © The Institution of Engineering and Technology 2019. The Definitive Version of Record can be found online at: https://doi.org/10.1049/iet-com.2019.0436.