A Deadline-Aware Scheduling Scheme for Connected Car Services Using Mobile Networks with Quality Fluctuation

Nobuhiko ITOH; Motoki MORITA; Takanori IWAI; Kozo SATODA; Ryogo KUBO

doi:10.1587/transcom.2018NVP0002

Open Access
A Deadline-Aware Scheduling Scheme for Connected Car Services Using Mobile Networks with Quality Fluctuation

Nobuhiko ITOH, Motoki MORITA, Takanori IWAI, Kozo SATODA, Ryogo KUBO

Full Text Views

108

Cite this

Free PDF (2.2MB)

Summary :

Traffic collision is an extremely serious issue in the world today. The World Health Organization (WHO) reported the number of road traffic deaths globally has plateaued at 1.25 million a year. In an attempt to decrease the occurrence of such traffic collisions, various driving systems for detecting pedestrians and vehicles have been proposed, but they are inadequate as they cannot detect vehicles and pedestrians in blind places such as sharp bends and blind intersections. Therefore, mobile networks such as long term evolution (LTE), LTE-Advanced, and 5G networks are attracting a great deal of attention as platforms for connected car services. Such platforms enable individual devices such as vehicles, drones, and sensors to exchange real-time information (e.g., location information) with each other. To guarantee effective connected car services, it is important to deliver a data block within a certain maximum tolerable delay (called a deadline in this work). The Third Generation Partnership Project (3GPP) stipulates that this deadline be 100 ms and that the arrival ratio within the deadline be 0.95. We investigated an intersection at which vehicle collisions often occur to evaluate a realistic environment and found that schedulers such as proportional fairness (PF) and payload-size and deadline-aware (PayDA) cannot satisfy the deadline and arrival ratio within the deadline, especially as network loads increase. They fail because they do not consider three key elements — radio quality, chunk size, and the deadline — when radio resources are allocated. In this paper, we propose a deadline-aware scheduling scheme that considers chunk size and the deadline in addition to radio quality and uses them to prioritize users in order to meet the deadline. The results of a simulation on ns-3 showed that the proposed method can achieve approximately four times the number of vehicles satisfying network requirements compared to PayDA.

Publication: IEICE TRANSACTIONS on Communications Vol.E102-B No.3 pp.474-483

Publication Date: 2019/03/01

Publicized: 2018/09/20

Online ISSN: 1745-1345

DOI: 10.1587/transcom.2018NVP0002

Type of Manuscript: Special Section PAPER (Special Section on Network Virtualization and Network Softwarization for Diverse 5G Services)

Category

Authors

Nobuhiko ITOH
  NEC Corporation
Motoki MORITA
  NEC Corporation
Takanori IWAI
  NEC Corporation
Kozo SATODA
  NEC Corporation
Ryogo KUBO
  Keio University

Keyword

IoT, resource control, 5G, LTE, connected car, V2X

Cite this

Copy

Nobuhiko ITOH, Motoki MORITA, Takanori IWAI, Kozo SATODA, Ryogo KUBO, "A Deadline-Aware Scheduling Scheme for Connected Car Services Using Mobile Networks with Quality Fluctuation" in IEICE TRANSACTIONS on Communications, vol. E102-B, no. 3, pp. 474-483, March 2019, doi: 10.1587/transcom.2018NVP0002.
Abstract: Traffic collision is an extremely serious issue in the world today. The World Health Organization (WHO) reported the number of road traffic deaths globally has plateaued at 1.25 million a year. In an attempt to decrease the occurrence of such traffic collisions, various driving systems for detecting pedestrians and vehicles have been proposed, but they are inadequate as they cannot detect vehicles and pedestrians in blind places such as sharp bends and blind intersections. Therefore, mobile networks such as long term evolution (LTE), LTE-Advanced, and 5G networks are attracting a great deal of attention as platforms for connected car services. Such platforms enable individual devices such as vehicles, drones, and sensors to exchange real-time information (e.g., location information) with each other. To guarantee effective connected car services, it is important to deliver a data block within a certain maximum tolerable delay (called a deadline in this work). The Third Generation Partnership Project (3GPP) stipulates that this deadline be 100 ms and that the arrival ratio within the deadline be 0.95. We investigated an intersection at which vehicle collisions often occur to evaluate a realistic environment and found that schedulers such as proportional fairness (PF) and payload-size and deadline-aware (PayDA) cannot satisfy the deadline and arrival ratio within the deadline, especially as network loads increase. They fail because they do not consider three key elements — radio quality, chunk size, and the deadline — when radio resources are allocated. In this paper, we propose a deadline-aware scheduling scheme that considers chunk size and the deadline in addition to radio quality and uses them to prioritize users in order to meet the deadline. The results of a simulation on ns-3 showed that the proposed method can achieve approximately four times the number of vehicles satisfying network requirements compared to PayDA.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2018NVP0002/_p

Copy

@ARTICLE{e102-b_3_474,
author={Nobuhiko ITOH, Motoki MORITA, Takanori IWAI, Kozo SATODA, Ryogo KUBO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Deadline-Aware Scheduling Scheme for Connected Car Services Using Mobile Networks with Quality Fluctuation},
year={2019},
volume={E102-B},
number={3},
pages={474-483},
abstract={Traffic collision is an extremely serious issue in the world today. The World Health Organization (WHO) reported the number of road traffic deaths globally has plateaued at 1.25 million a year. In an attempt to decrease the occurrence of such traffic collisions, various driving systems for detecting pedestrians and vehicles have been proposed, but they are inadequate as they cannot detect vehicles and pedestrians in blind places such as sharp bends and blind intersections. Therefore, mobile networks such as long term evolution (LTE), LTE-Advanced, and 5G networks are attracting a great deal of attention as platforms for connected car services. Such platforms enable individual devices such as vehicles, drones, and sensors to exchange real-time information (e.g., location information) with each other. To guarantee effective connected car services, it is important to deliver a data block within a certain maximum tolerable delay (called a deadline in this work). The Third Generation Partnership Project (3GPP) stipulates that this deadline be 100 ms and that the arrival ratio within the deadline be 0.95. We investigated an intersection at which vehicle collisions often occur to evaluate a realistic environment and found that schedulers such as proportional fairness (PF) and payload-size and deadline-aware (PayDA) cannot satisfy the deadline and arrival ratio within the deadline, especially as network loads increase. They fail because they do not consider three key elements — radio quality, chunk size, and the deadline — when radio resources are allocated. In this paper, we propose a deadline-aware scheduling scheme that considers chunk size and the deadline in addition to radio quality and uses them to prioritize users in order to meet the deadline. The results of a simulation on ns-3 showed that the proposed method can achieve approximately four times the number of vehicles satisfying network requirements compared to PayDA.},
keywords={},
doi={10.1587/transcom.2018NVP0002},
ISSN={1745-1345},
month={March},}

Copy

TY - JOUR
TI - A Deadline-Aware Scheduling Scheme for Connected Car Services Using Mobile Networks with Quality Fluctuation
T2 - IEICE TRANSACTIONS on Communications
SP - 474
EP - 483
AU - Nobuhiko ITOH
AU - Motoki MORITA
AU - Takanori IWAI
AU - Kozo SATODA
AU - Ryogo KUBO
PY - 2019
DO - 10.1587/transcom.2018NVP0002
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E102-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2019
AB - Traffic collision is an extremely serious issue in the world today. The World Health Organization (WHO) reported the number of road traffic deaths globally has plateaued at 1.25 million a year. In an attempt to decrease the occurrence of such traffic collisions, various driving systems for detecting pedestrians and vehicles have been proposed, but they are inadequate as they cannot detect vehicles and pedestrians in blind places such as sharp bends and blind intersections. Therefore, mobile networks such as long term evolution (LTE), LTE-Advanced, and 5G networks are attracting a great deal of attention as platforms for connected car services. Such platforms enable individual devices such as vehicles, drones, and sensors to exchange real-time information (e.g., location information) with each other. To guarantee effective connected car services, it is important to deliver a data block within a certain maximum tolerable delay (called a deadline in this work). The Third Generation Partnership Project (3GPP) stipulates that this deadline be 100 ms and that the arrival ratio within the deadline be 0.95. We investigated an intersection at which vehicle collisions often occur to evaluate a realistic environment and found that schedulers such as proportional fairness (PF) and payload-size and deadline-aware (PayDA) cannot satisfy the deadline and arrival ratio within the deadline, especially as network loads increase. They fail because they do not consider three key elements — radio quality, chunk size, and the deadline — when radio resources are allocated. In this paper, we propose a deadline-aware scheduling scheme that considers chunk size and the deadline in addition to radio quality and uses them to prioritize users in order to meet the deadline. The results of a simulation on ns-3 showed that the proposed method can achieve approximately four times the number of vehicles satisfying network requirements compared to PayDA.
ER -