Abstract
The purpose of the packet scheduling algorithm is to calculate the order in which users are allocated resource blocks according to the scheduling formula when there are multiple services that need to transmit data at the same time. Furthermore, the channel state, priority, past throughput and other factors of the node should be comprehensively considered. In this paper, a packet scheduling algorithm based on service priority and fairness is proposed. The algorithm can realize differentiated treatment of different priorities, and can dynamically increase the priority when there is no resource allocation for medium and low priorities for a long time. The simulation results of the proposed scheduler indicate an evident improvement of the QoS performance parameters for non-emergency services, packet loss rate, average throughput, fairness.
Original language | English |
---|---|
Pages (from-to) | 905-910 |
Number of pages | 6 |
Journal | IEEE Information Technology and Mechatronics Engineering Conference, ITOEC |
Issue number | 2025 |
DOIs | |
State | Published - 2025 |
Event | 8th IEEE Information Technology and Mechatronics Engineering Conference, ITOEC 2025 - Chongqing, China Duration: 14 Mar 2025 → 16 Mar 2025 |
Keywords
- fairness
- multiple priority
- Qos
- scheduling algorithm