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

    研究成果: Article

    抜粋

    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.

    元の言語English
    ページ(範囲)474-483
    ページ数10
    ジャーナルIEICE Transactions on Communications
    E102B
    発行部数3
    DOI
    出版物ステータスPublished - 2019 3

    ASJC Scopus subject areas

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

    フィンガープリント A deadline-aware scheduling scheme for connected car services using mobile networks with quality fluctuation' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用