A QoS-Aware Scheduling Algorithm for High-Speed Railway Communication System

TL;DR

This paper proposes a novel QoS-aware scheduling algorithm for high-speed railway communication systems that effectively manages multiple services with diverse QoS needs, ensuring reliable multimedia delivery.

Contribution

It introduces a new scheduling algorithm leveraging train trajectory data and Lyapunov optimization to meet end-to-end deadlines and delivery ratios in HSR networks.

Findings

Outperforms conventional schemes in QoS compliance

Effectively manages dynamic link capacity

Ensures deadline and delivery ratio requirements

Abstract

With the rapid development of high-speed railway (HSR), how to provide the passengers with multimedia services has attracted increasing attention. A key issue is to develop an effective scheduling algorithm for multiple services with different quality of service (QoS) requirements. In this paper, we investigate the downlink service scheduling problem in HSR network taking account of end-to-end deadline constraints and successfully packet delivery ratio requirements. Firstly, by exploiting the deterministic high-speed train trajectory, we present a time-distance mapping in order to obtain the highly dynamic link capacity effectively. Next, a novel service model is developed for deadline constrained services with delivery ratio requirements, which enables us to turn the delivery ratio requirement into a single queue stability problem. Based on the Lyapunov drift, the optimal scheduling problem is formulated and the corresponding scheduling service algorithm is proposed by stochastic network optimization approach. Simulation results show that the proposed algorithm outperforms the conventional schemes in terms of QoS requirements.