Szczegóły publikacji
Opis bibliograficzny
Resource management in LADNs supporting 5G V2X communications / Ren-Hung Hwang, Faysal MARZUK, Marek SIKORA, Piotr CHOŁDA, Ying-Dar Lin // IEEE Access [Dokument elektroniczny]. — Czasopismo elektroniczne ; ISSN 2169-3536. — 2023 — vol. 11, s. 63958-63971. — Wymagania systemowe: Adobe Reader. — Bibliogr. s. 63970-63971, Abstr. — Publikacja dostępna online od: 2023-06-22
Autorzy (5)
- Hwang Ren-Hung
- AGHMarzuk Faysal
- AGHSikora Marek
- AGHChołda Piotr
- Lin Ying-Dar
Słowa kluczowe
Dane bibliometryczne
ID BaDAP | 147600 |
---|---|
Data dodania do BaDAP | 2023-07-27 |
Tekst źródłowy | URL |
DOI | 10.1109/ACCESS.2023.3288699 |
Rok publikacji | 2023 |
Typ publikacji | artykuł w czasopiśmie |
Otwarty dostęp | |
Creative Commons | |
Czasopismo/seria | IEEE Access |
Abstract
Local access data networks (LADNs) are promising paradigms for reducing latency, decreasing energy consumption, and improving the quality of service (QoS) of fifth-generation (5G) radio access networks (RANs) that support vehicle-to-everything (V2X) communications. Remote radio heads (RRHs) that support V2X applications can be turned on or off depending on traffic demand to achieve optimal resource management and save energy by minimizing the activation of LADN servers in cloud-RANs (C-RANs). In this study, we investigated the problem of how to manage resources optimally in LADN while guaranteeing V2X QoS requirements. We formulated the resource allocation problem as an optimization problem to reduce the number of active RRHs subject to uplink bandwidth constraints. We calculated intercell interference (ICI) and uplink signal-to-interference-plus-noise ratio (SINR) to appropriately assign vehicles to RRHs. We solved the resource management problem by using an optimal algorithm and proposed heuristic algorithms to address the complexity of large-scale scenarios. The numerical results demonstrated that our model could efficiently utilize resources and provide optimal associations between vehicles and RRHs, thereby leading to energy savings. In particular, optimal associations could save up to 70% of energy in a scenario consisting of hundreds of vehicles. The computation time for a small-sized problem was approximately 60 ms, which means that the proposed model can be suitable for real-time control. Even on a large scale, the running time for a scenario with thousands of vehicles is still short. Therefore, the impact of vehicles’ density is not harmful to the scalability of the whole approach.