Vehicular networks have attracted a lot of research attention in the last decades. The main goal of vehicular communication is to ensure road safety by enabling the periodic communications between vehicles and between vehicles and other participants, such as roadside units.
Cellular-Vehicle-to-Everything (C-V2X) is a leading technology for vehicular networks. LTE-V2X is the first C-V2X technology, followed by 5G-V2X, and in both, resource allocation mechanisms play an important role in their performance. The resource allocation algorithms proposed in C-V2X must meet the requirements of V2X applications.
Certainly, the safety-related applications are the most critical and time-constrained V2X applications. For this reason, in the first part of this thesis, we propose a clustering-based resource allocation algorithm for safety V2V communications, the Maximum Inter-Centroids Reuse Distance (MIRD), which aims to improve the reliability of safety V2V communications.
In the second part of this thesis, we address resource allocation in 5G-V2X technology. Before performing resource allocation in 5G-V2X, we first consider the flexibility of the NR frame structure of 5G by focusing our interest on the 5G numerology concept. Therefore, we first investigate the impact of 5G numerologies on V2X application performance. Through simulations, we showed that choosing the appropriate numerology is a trade-off between V2X applications requirements, Inter-Carrier Interference (ICI) and Inter-Symbol Interference (ISI).
Next, we propose a new resource allocation algorithm, namely the Priority and Satisfaction-based Resource Allocation in Mixed Numerology (PSRA-MN). In the PSRA-MN algorithm, we first select the appropriate numerology considering the channel conditions and the vehicle speed. Then, we apply a prioritization policy in favor of the safety-related traffic to ensure the required resources for the safety-related traffic, and the remaining resources after the safety allocation are optimally allocated to the non-safety vehicles so that the average satisfaction rate is maximized. The proposed PSRA-MN algorithm is validated by simulations. The obtained results show that PSRA-MN outperforms the traditional resource allocation algorithms in terms of average allocation rate, average satisfaction rate and average delay.