Notice: Due to planned maintenance, the website will be unavailable from 3:00 PM to 10:00 PM on Wednesday, February 11, 2026
We apologise in advance for any inconvenience that may be caused and thank you for your understanding.
To content
Fakultät für Elektrotechnik und Informationstechnik
S. Monhof, M. Haferkamp, B. Sliwa, C. Wietfeld

Payload-size and Deadline-aware Scheduling for Upcoming 5G Networks: Experimental Validation in High-load Scenarios

-
in
  • Benjamin Sliwa
  • Marcus Haferkamp
  • Univ.-Prof. Dr.-Ing. Christian Wietfeld
  • Publications
  • CPS.HUB
  • BERCOM
  • SFB 876

In 2018 IEEE 88th IEEE Vehicular Technology Conference (VTC-Fall), Chicago, USA, August 2018.

Abstract:

High data rates, low latencies, and a widespread availability are the key properties why current cellular network technologies are used for many different applications. However, the coexistence of different data traffic types in the same 4G/5G-based public mobile network results in a significant growth of interfering data traffic competing for transmission. Particularly in the context of time-critical and highly dynamic Cyber Physical Systems (CPS) and Vehicle-to-Everything (V2X) applications, the compliance with deadlines and therefore the efficient allocation of scarce mobile radio resources is of high importance. Hence, scheduling solutions are required offering a good trade-off between the compliance with deadlines and a spectrum-efficient allocation of resources in mobile networks. In this paper, we present the results of an experimental validation of the Payload-size and Deadline-aware (PayDA) scheduling algorithm using a Software-Defined Radio (SDR)-based eNodeB. The results of the experimental validation prove the high efficiency of the proposed PayDA scheduling algorithm for time-critical applications in both miscellaneous and homogeneous data traffic scenarios.