The deployment of 6G vehicle-to-everything (V2X) networks is a challenging task given the 6G requirements of ultra-high data rates along with ultra-low latency levels. For intelligent transportation systems (ITSs), V2X communications involve a high density of user equipment (UE), vehicles, and next-generation Node-B (gNB). Therefore, optimal management of the current network infrastructure plays a key role in minimizing energy and latency. Optimal resource allocation using linear programming methods cannot be scaled to the required scenarios of 6G V2X communications and is not suitable for online allocation. To overcome these limitations, deep reinforcement learning (DRL) is a promising approach given its properties of direct integration with online allocation models. In this work, we investigate the problem of optimal resource allocation in 6G V2X networks, where ITSs are deployed to execute tasks offloaded by vehicles subject to data rate and latency requirements. We apply a policy optimization-based DRL to jointly reduce the number of active gNBs and the latency concerning the offloaded tasks going on in the vehicle. The model is analyzed for several ITS scenarios to investigate the performance observed and the advantages of the proposed policy optimization allocation for 6G V2X networks. Our evaluation results illustrate that the proposed DRL-based algorithm produces dynamic solutions that approximate the optimal ones at reasonable rates of energy consumption. Our numerical results indicate that DRL-based solutions are distinguished by equivalently balanced energy consumption under different scenarios.
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 formulated the resource allocation problem as an optimization problem to reduce the number of active RRHs subject to uplink bandwidth constraints. We calculated inter-cell 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. In addition, 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.
10 February 2025 in Journal of Telecommunications and Information Technology
Sixth generation (6G) vehicle-to-everything (V2X) systems face numerous security threats, including Sybil and denial-of-service (DoS) cyber-attacks. To provide a secure exchange of data and protect users' identities in 6G V2X communication systems, anonymization techniques - such as k-anonymity - can be used. In this work, we study centralized vs. k-anonymity based resource allocation methods in a vehicular edge computing (VEC) network. Allocation decisions for vehicular networks are classically posed as a centralized optimization task. Therefore, an information flow is transmitted from the vehicles to the communication premises. In addition to a resource allocation decision, vehicle information is not required. We analyze the centralized allocation versus k-anonymous allocation models. To show a potential deterioration introduced by anonymity, we quantify the gap in the optimal goal in two cases: based on resource allocation and with aim at energy reduction. Our numerical results indicate that energy consumption rises by 1% in smaller scenarios and 23% in medium scenarios, whereas it decreases by 14% in larger scenarios.