Joint Content Placement and Storage Allocation Based on Federated Learning in F-RANs

被引:8
作者
Xiao, Tuo [1 ,2 ]
Cui, Taiping [1 ,2 ]
Islam, S. M. Riazul [3 ]
Chen, Qianbin [2 ]
机构
[1] Chongqing Univ Posts & Telecommun, Sch Commun & Informat Engn, Chongqing 400065, Peoples R China
[2] Chongqing Key Labs Mobile Commun, Chongqing 400065, Peoples R China
[3] Sejong Univ, Dept Comp Sci & Engn, Seoul 05006, South Korea
关键词
fog radio access network; content placement; storage allocation; federated learning; EDGE; DELIVERY; CACHE;
D O I
10.3390/s21010215
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
With the rapid development of mobile communication and the sharp increase of smart mobile devices, wireless data traffic has experienced explosive growth in recent years, thus injecting tremendous traffic into the network. Fog Radio Access Network (F-RAN) is a promising wireless network architecture to accommodate the fast growing data traffic and improve the performance of network service. By deploying content caching in F-RAN, fast and repeatable data access can be achieved, which reduces network traffic and transmission latency. Due to the capacity limit of caches, it is essential to predict the popularity of the content and pre-cache them in edge nodes. In general, the classic prediction approaches require the gathering of users' personal information at a central unit, giving rise to users' privacy issues. In this paper, we propose an intelligent F-RANs framework based on federated learning (FL), which does not require gathering user data centrally on the server for training, so it can effectively ensure the privacy of users. In the work, federated learning is applied to user demand prediction, which can accurately predict the content popularity distribution in the network. In addition, to minimize the total traffic cost of the network in consideration of user content requests, we address the allocation of storage resources and content placement in the network as an integrated model and formulate it as an Integer Linear Programming (ILP) problem. Due to the high computational complexity of the ILP problem, two heuristic algorithms are designed to solve it. Simulation results show that the performance of our proposed algorithm is close to the optimal solution.
引用
收藏
页码:1 / 20
页数:20
相关论文
共 42 条
[1]  
Abboud A, 2015, IEEE INT WORK SIGN P, P171, DOI 10.1109/SPAWC.2015.7227022
[2]   Caching on the World Wide Web [J].
Aggarwal, C ;
Wolf, JL ;
Yu, PS .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1999, 11 (01) :94-107
[3]  
Ahlehagh H., 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC), P2276, DOI 10.1109/WCNC.2012.6214173
[4]  
[Anonymous], 2009, Chest. Internet
[5]   A Critical Evaluation of Privacy and Security Threats in Federated Learning [J].
Asad, Muhammad ;
Moustafa, Ahmed ;
Yu, Chao .
SENSORS, 2020, 20 (24) :1-15
[6]   Living on the Edge: The Role of Proactive Caching in 5G Wireless Networks [J].
Bastug, Ejder ;
Bennis, Mehdi ;
Debbah, Merouane .
IEEE COMMUNICATIONS MAGAZINE, 2014, 52 (08) :82-89
[7]  
Ben Hassine N, 2017, IFIP WIREL DAY, P113, DOI 10.1109/WD.2017.7918125
[8]  
Blasco P, 2014, IEEE ICC, P1897, DOI 10.1109/ICC.2014.6883600
[9]   Construction of (Ni, Cu) Se2//Reduced Graphene Oxide for High Energy Density Asymmetric Supercapacitor [J].
Chen, Bo ;
Tian, Yifan ;
Yang, Zhaoxi ;
Ruan, Yunjun ;
Jiang, Jianjun ;
Wang, Chundong .
CHEMELECTROCHEM, 2017, 4 (11) :3004-3010
[10]   Fog and IoT: An Overview of Research Opportunities [J].
Chiang, Mung ;
Zhang, Tao .
IEEE INTERNET OF THINGS JOURNAL, 2016, 3 (06) :854-864