University of Oulu

Y. Jiang, W. Huang, M. Bennis and F. Zheng, "Decentralized Asynchronous Coded Caching Design and Performance Analysis in Fog Radio Access Networks," in IEEE Transactions on Mobile Computing, vol. 19, no. 3, pp. 540-551, 1 March 2020. doi: 10.1109/TMC.2019.2896970

Decentralized asynchronous coded caching design and performance analysis in fog radio access networks

Saved in:
Author: Jiang, Yanxiang1,2,3; Huang, Wenlong1; Bennis, Mehdi4;
Organizations: 1National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China
2State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an 710071, China
3Key Laboratory of Wireless Sensor Network & Communication, Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, 865 Changning Road, Shanghai 200050, China
4Centre for Wireless Communications, University of Oulu, Oulu 90014, Finland
5School of Electronic and Information Engineering, Harbin Institute of Technology, Shenzhen 518055, China
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 7.2 MB)
Persistent link:
Language: English
Published: Institute of Electrical and Electronics Engineers, 2019
Publish Date: 2019-12-09


In this paper, we investigate the problem of asynchronous coded caching in fog radio access networks (F-RAN). To minimize the fronthaul load, the encoding set collapsing rule and encoding set partition method are proposed to establish the relationship between the coded-multicasting contents for asynchronous and synchronous coded caching. Furthermore, a decentralized asynchronous coded caching scheme is proposed, which provides asynchronous and synchronous transmission methods for different delay requirements. The closed-form expression of the fronthaul load is established for the special case where the number of requests during each time slot is fixed, and the upper and lower bounds of the fronthaul load are given for the general case where the number of requests during each time slot is random. The simulation results show that our proposed scheme can create considerable coded-multicasting opportunities in asynchronous request scenarios.

see all

Series: IEEE transactions on mobile computing
ISSN: 1536-1233
ISSN-E: 1558-0660
ISSN-L: 1536-1233
Volume: 19
Issue: 3
Pages: 540 - 551
DOI: 10.1109/TMC.2019.2896970
Type of Publication: A1 Journal article – refereed
Field of Science: 213 Electronic, automation and communications engineering, electronics
Funding: This work was supported in part by the Natural Science Foundation of Jiangsu Province under grant BK20181264, the Research Fund of the State Key Laboratory of Integrated Services Networks (Xidian University) under grant ISN19-10, the Research Fund of the Key Laboratory of Wireless Sensor Network & Communication (Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences) under grant 2017002, the National Basic Research Program of China (973 Program) under grant 2012CB316004, a Shenzhen Municipality/HITSZ Start-Up Grant entitled “Energy-Efficient Low-Latency Wireless Networks”, and the U.K. Engineering and Physical Sciences Research Council under Grant EP/K040685/2.
Copyright information: © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.