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

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)474-483
Number of pages10
JournalIEICE Transactions on Communications
VolumeE102B
Issue number3
DOIs
Publication statusPublished - 2019 Mar 1

Fingerprint

Wireless networks
Railroad cars
Scheduling
Long Term Evolution (LTE)
Health
Sensors

Keywords

  • 5G
  • Connected car
  • IoT
  • LTE
  • Resource control
  • V2X

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

A deadline-aware scheduling scheme for connected car services using mobile networks with quality fluctuation. / Itoh, Nobuhiko; Morita, Motoki; Iwai, Takanori; Satoda, Kozo; Kubo, Ryogo.

In: IEICE Transactions on Communications, Vol. E102B, No. 3, 01.03.2019, p. 474-483.

Research output: Contribution to journalArticle

Itoh, Nobuhiko ; Morita, Motoki ; Iwai, Takanori ; Satoda, Kozo ; Kubo, Ryogo. / A deadline-aware scheduling scheme for connected car services using mobile networks with quality fluctuation. In: IEICE Transactions on Communications. 2019 ; Vol. E102B, No. 3. pp. 474-483.
@article{326cd3ca6fdf4d20b0bccbeda5f7c453,
title = "A deadline-aware scheduling scheme for connected car services using mobile networks with quality fluctuation",
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 = "5G, Connected car, IoT, LTE, Resource control, V2X",
author = "Nobuhiko Itoh and Motoki Morita and Takanori Iwai and Kozo Satoda and Ryogo Kubo",
year = "2019",
month = "3",
day = "1",
doi = "10.1587/transcom.2018NVP0002",
language = "English",
volume = "E102B",
pages = "474--483",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "3",

}

TY - JOUR

T1 - A deadline-aware scheduling scheme for connected car services using mobile networks with quality fluctuation

AU - Itoh, Nobuhiko

AU - Morita, Motoki

AU - Iwai, Takanori

AU - Satoda, Kozo

AU - Kubo, Ryogo

PY - 2019/3/1

Y1 - 2019/3/1

N2 - 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.

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.

KW - 5G

KW - Connected car

KW - IoT

KW - LTE

KW - Resource control

KW - V2X

UR - http://www.scopus.com/inward/record.url?scp=85063985317&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85063985317&partnerID=8YFLogxK

U2 - 10.1587/transcom.2018NVP0002

DO - 10.1587/transcom.2018NVP0002

M3 - Article

AN - SCOPUS:85063985317

VL - E102B

SP - 474

EP - 483

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 3

ER -