TY - GEN
T1 - VehA & PedA mobility based scheduling in future communication networks
AU - Ashfaq, Khuram
AU - Safdar, Ghazanfar
AU - Ur-Rehman, Masood
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023/8/14
Y1 - 2023/8/14
N2 - The primary means of communication is quickly evolving to be wireless communications. However, when compared to wired links, their properties render traffic susceptible to time and location-dependent signal attenuation, noise, fading, and interference, resulting in time variable channel capacity and link error rate. Scheduling algorithms are critical in wireless connections for ensuring quality of service (QoS) metrics such as throughput, latency, jitter, fairness, and packet loss rate. The scheduler is critical in current and future cellular communications because it assigns resource blocks (RB) to different users for transmission. The scheduling algorithm decides based on the link state, number of sessions, reserved rates, and the status of the session queues. The information required by a scheduler implemented in the base station can be easily gathered from the downlink stream. It evaluates the performance of four well-known scheduling methods, including round robin (RR), best channel quality indicator (BCQI), proportional fair (PF), and fractional frequency reuse (FFR), for dynamic use Pedestrian (PedA) and Vehicular (VehA). The performance of these four algorithms is measured in terms of throughput, fairness index, spectral efficiency, and overall effectiveness. System-level simulations were carried out utilizing a MATLAB-based LTE-A Vienna simulator.
AB - The primary means of communication is quickly evolving to be wireless communications. However, when compared to wired links, their properties render traffic susceptible to time and location-dependent signal attenuation, noise, fading, and interference, resulting in time variable channel capacity and link error rate. Scheduling algorithms are critical in wireless connections for ensuring quality of service (QoS) metrics such as throughput, latency, jitter, fairness, and packet loss rate. The scheduler is critical in current and future cellular communications because it assigns resource blocks (RB) to different users for transmission. The scheduling algorithm decides based on the link state, number of sessions, reserved rates, and the status of the session queues. The information required by a scheduler implemented in the base station can be easily gathered from the downlink stream. It evaluates the performance of four well-known scheduling methods, including round robin (RR), best channel quality indicator (BCQI), proportional fair (PF), and fractional frequency reuse (FFR), for dynamic use Pedestrian (PedA) and Vehicular (VehA). The performance of these four algorithms is measured in terms of throughput, fairness index, spectral efficiency, and overall effectiveness. System-level simulations were carried out utilizing a MATLAB-based LTE-A Vienna simulator.
KW - scheduling algorithms
KW - cellular networks
KW - radio resource allocation
KW - quality of service
KW - Radio Resource Allocation
KW - Scheduling Algorithms
KW - Cellular Networks
KW - Quality of Service
UR - https://www.scopus.com/pages/publications/85169787392
U2 - 10.1109/VTC2023-Spring57618.2023.10201085
DO - 10.1109/VTC2023-Spring57618.2023.10201085
M3 - Conference contribution
SN - 9798350311143
T3 - IEEE Vehicular Technology Conference
BT - 2023 IEEE 97th Vehicular Technology Conference, VTC 2023-Spring - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 IEEE 97th Vehicular Technology Conference (VTC2023-Spring)
Y2 - 20 June 2023 through 23 June 2023
ER -