Congestion-Adaptive and Deadline-Aware Scheduling for Connected Car Services over Mobile Networks

被引:0
作者
Itoh, Nobuhiko [1 ,2 ]
Iwai, Takanori [1 ,2 ]
Kubo, Ryogo [1 ]
机构
[1] Keio Univ, Dept Elect & Elect Engn, Yokohama, Kanagawa 2238522, Japan
[2] NEC Corp Ltd, Syst Platform Res Labs, Kawasaki, Kanagawa 2118666, Japan
关键词
QoS; deadline; IoT; connected car; mobile network; scheduling; MEC;
D O I
10.1587/transcom.2019EBT0007
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Road traffic collisions are an extremely serious and often fatal issue. One promising approach to mitigate such collisions is the use of connected car services that share road traffic information obtained from vehicles and cameras over mobile networks. In connected car services, it is important for data chunks to arrive at a destination node within a certain deadline constraint. In this paper, we define a flow from a vehicle (or camera) to the same vehicle (or camera) via an MEC server, as a mission critical (MC) flow, and call a deadline of the MC flow the MC deadline. Our research objective is to achieve a higher arrival ratio within the MC deadline for the MC flow that passes through both the radio uplink and downlink. We previously developed a deadline-aware scheduler with consideration for quality fluctuation (DAS-QF) that considers chunk size and a certain deadline constraint in addition to radio quality and utilizes these to prioritize users such that the deadline constraints are met. However, this DAS-QF does not consider that the congestion levels of evolved NodeB (eNB) differ depending on the eNB location, or that the uplink congestion level differs from the downlink congestion level in the same eNB. Therefore, in the DAS-QF, some data chunks of a MC flow are discarded in the eNB when they exceed either the uplink or downlink deadline in congestion, even if they do not exceed the MC deadline. In this paper, to reduce the eNB packet drop probability due to exceeding either the uplink and downlink deadline, we propose a deadline coordination function (DCF) that adaptively sets each of the uplink and downlink deadlines for the MC flow according to the congestion level of each link. Simulation results show that the DAS-QF with DCF offers higher arrival ratios within the MC deadline compared to DAS-QF on its own
引用
收藏
页码:1117 / 1126
页数:10
相关论文
共 32 条
[21]   Cloud Resource Autoscaling System based on Hidden Markov Model (HMM) [J].
Nikravesh, Ali Yadavar ;
Ajila, Samuel A. ;
Lung, Chung-Horng .
2014 IEEE INTERNATIONAL CONFERENCE ON SEMANTIC COMPUTING (ICSC), 2014, :124-127
[22]  
Piro G., 2011, P 4 INT ICST C SIM T, P9, DOI [10.4108/icst.simutools.2011.245571, DOI 10.4108/ICST.SIMUTOOLS.2011.245571]
[23]   Survey on Multi-Access Edge Computing for Internet of Things Realization [J].
Porambage, Pawani ;
Okwuibe, Jude ;
Liyanage, Madhusanka ;
Ylianttila, Mika ;
Taleb, Tarik .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2018, 20 (04) :2961-2991
[24]  
Redmon J., 2018, ARXIV, V3
[25]  
Saba S., 2012, INT J ADV RES COMPUT, P201
[26]  
Shi Qiang Liu, 2015, 2015 IEEE Sensors. Proceedings, P1, DOI 10.1109/ICSENS.2015.7370336
[27]  
Sliwa B., 2017, WIRELESS DAYS
[28]   SUPPORT FOR VEHICLE-TO-EVERYTHING SERVICES BASED ON LTE [J].
Sun, Shao-Hui ;
Hu, Jin-Ling ;
Peng, Ying ;
Pan, Xue-Ming ;
Zhao, Li ;
Fang, Jia-Yi .
IEEE WIRELESS COMMUNICATIONS, 2016, 23 (03) :4-8
[29]   On Multi-Access Edge Computing: A Survey of the Emerging 5G Network Edge Cloud Architecture and Orchestration [J].
Taleb, Tarik ;
Samdanis, Konstantinos ;
Mada, Badr ;
Flinck, Hannu ;
Dutta, Sunny ;
Sabella, Dario .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2017, 19 (03) :1657-1681
[30]  
Temperton J., 2015, ONE NATION UNDER CCT