Smart Network Slicing for Vehicular Fog-RANs

被引:65
作者
Xiong, Kai [1 ]
Leng, Supeng [1 ]
Hu, Jie [1 ]
Chen, Xiaosha [1 ]
Yang, Kun [2 ,3 ]
机构
[1] Univ Elect Sci & Technol China, Sch Informat & Commun Engn, Chengdu 611731, Sichuan, Peoples R China
[2] Univ Elect Sci & Technol China, Zhongshan Inst, Chengdu 610054, Sichuan, Peoples R China
[3] Univ Essex, Sch Comp Sci & Elect Engn, Colchester CO4 3SQ, Essex, England
基金
中国国家自然科学基金; 欧盟地平线“2020”;
关键词
V-FRAN; Network Slicing; Cross Entropy; Monte Carlo Tree Search;
D O I
10.1109/TVT.2019.2900234
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Modern transportation systems are facing a sharp alteration since the Internet of Vehicles (IoV) has activated intense information exchange among vehicles, infrastructure, and pedestrians. Existing approaches fail in efficiently handling the heterogeneous network traffic because of the complicated network environment and dynamic vehicle density. Recently, the fog-radio access network with network slicing has emerged as a promising solution to fulfill the demands of the maldistributed network traffic. However, available fog resources as well as network traffic are all dynamic and unpredictable due to high mobility of vehicles, which results in weak resource utilization. To address this problem, we propose a smart slice scheduling scheme in vehicular fog radio access networks. This scheduling scheme is formed as a Markov decision process. Accordingly, an intelligent algorithm for network slices is proposed based on the Monte Carlo tree search in terms of a new metric cross entropy, which is able to allocate the resource allocation for the match of traffic load in the time-space domain. This slice scheduling algorithm does not require any prior knowledge of the network traffic. Furthermore, this paper first reveals the relationship between road traffic and the IoV resource based on the metric perception-reaction time. A collaborative scheduling scheme is proposed to tune the road traffic speed to further release available IoV resource under the heavy traffic load. Simulation results indicate that the proposed algorithm outperforms several baselines in terms of throughput and delay with low complexity.
引用
收藏
页码:3075 / 3085
页数:11
相关论文
共 29 条
[1]   Network Slicing and Softwarization: A Survey on Principles, Enabling Technologies, and Solutions [J].
Afolabi, Ibrahim ;
Taleb, Tarik ;
Samdanis, Konstantinos ;
Ksentini, Adlen ;
Flinck, Hannu .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2018, 20 (03) :2429-2453
[2]  
Baier H., 2012, P EUR C ART INT
[3]   A Survey of Monte Carlo Tree Search Methods [J].
Browne, Cameron B. ;
Powley, Edward ;
Whitehouse, Daniel ;
Lucas, Simon M. ;
Cowling, Peter I. ;
Rohlfshagen, Philipp ;
Tavener, Stephen ;
Perez, Diego ;
Samothrakis, Spyridon ;
Colton, Simon .
IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2012, 4 (01) :1-43
[4]   5G NETWORK SLICING FOR VEHICLE-TO-EVERYTHING SERVICES [J].
Campolo, Claudia ;
Molinaro, Antonella ;
Iera, Antonio ;
Menichella, Francesco .
IEEE WIRELESS COMMUNICATIONS, 2017, 24 (06) :38-45
[5]  
Cohen H, 2011, NUMERICAL APPROXIMATION METHODS, P1, DOI 10.1007/978-1-4419-9837-8_1
[6]   Monte-Carlo tree search and rapid action value estimation in computer Go [J].
Gelly, Sylvain ;
Silver, David .
ARTIFICIAL INTELLIGENCE, 2011, 175 (11) :1856-1875
[7]   A Dynamic Wideband Directional Channel Model for Vehicle-to-Vehicle Communications [J].
He, Ruisi ;
Renaudin, Olivier ;
Kolmonen, Veli-Matti ;
Haneda, Katsuyuki ;
Zhong, Zhangdui ;
Ai, Bo ;
Oestges, Claude .
IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2015, 62 (12) :7870-7882
[8]   Vehicular Multi-Access Edge Computing With Licensed Sub-6 GHz, IEEE 802.11p and mmWave [J].
Hu, Qitu ;
Wu, Celimuge ;
Zhao, Xiaobing ;
Chen, Xianfu ;
Ji, Yusheng ;
Yoshinaga, Tsutomu .
IEEE ACCESS, 2018, 6 :1995-2004
[9]  
James S, 2017, AAAI CONF ARTIF INTE, P3576
[10]   A Simple Free-Flow Traffic Model for Vehicular Intermittently Connected Networks [J].
Khabbaz, Maurice J. ;
Fawaz, Wissam F. ;
Assi, Chadi M. .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2012, 13 (03) :1312-1326