University of Oulu

C. Xia, Y. Jiang, M. Peng, F. Zheng, M. Bennis and X. You, "Cooperative Edge Caching in Fog Radio Access Networks: A Pigeon Inspired Optimization Approach," 2019 IEEE Global Communications Conference (GLOBECOM), Waikoloa, HI, USA, 2019, pp. 1-6, https://doi.org/10.1109/GLOBECOM38437.2019.9013976

Cooperative edge caching in fog radio access networks : a pigeon inspired optimization approach

Saved in:
Author: Xia, Chengyu1,2,3; Jiang, Yanxiang1,2,3; Peng, Mugen4;
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
4School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, China
5School of Electronic and Information Engineering, Harbin Institute of Technology, Shenzhen 518055, China
6Centre for Wireless Communications, University of Oulu, Oulu 90014, Finland
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 1.1 MB)
Persistent link: http://urn.fi/urn:nbn:fi-fe2020050525024
Language: English
Published: Institute of Electrical and Electronics Engineers, 2019
Publish Date: 2020-05-05
Description:

Abstract

In this paper, the cooperative edge caching problem in fog radio access networks (F-RANs) is investigated to minimize the average download delay. Considering the non-linear and coupled multi-variable nature of the original optimizing problem, we transform it into an equivalent integer linear programming problem with decoupled variables. Then, we decomposed the transformed problem into two subproblems which can be solved separately by each fog access point (F-AP). Considering the non-deterministic polynomial hard (NP-hard) nature of the two decomposed subproblems, we propose an improved pigeon inspired optimization (PIO) based cooperative edge caching scheme, which utilizes Cauchy perturbation and self-adaptive factor to avoid pre-mature convergence and achieve a better search performance, respectively. Our proposed scheme not only allows F-APs to make cache decisions with low computational complexity, but also has very low message passing overhead. Simulation results show that our proposed scheme can greatly decrease the average download delay.

see all

Series: IEEE Global Communications Conference
ISSN: 2334-0983
ISSN-E: 2576-6813
ISSN-L: 2334-0983
ISBN: 978-1-7281-0962-6
ISBN Print: 978-1-7281-0963-3
Article number: 9013976
DOI: 10.1109/GLOBECOM38437.2019.9013976
OADOI: https://oadoi.org/10.1109/GLOBECOM38437.2019.9013976
Host publication: 2019 IEEE Global Communications Conference (GLOBECOM), December 9-14, Waikoloa, HI, USA
Conference: IEEE Global Communications Conference
Type of Publication: A4 Article in conference proceedings
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 61971129, the Natural Science Foundation of Jiangsu Province under Grant BK20181264, the National Key R&D Program of China under Grant 2018YFB1801103, 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 and the Research Fund of the School of Electronic and Information Engineering, Harbin Institute of Technology (Shenzhen) under Grant HITSZ20190631.
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.