To provide a better support for various vehicular applications, digital twin (DT), as an emerging technology, can enable a virtual presentation of physical vehicular networks to reflect the current network state through real-time data updating. However, the constrained resources and high data updating cost may degrade the performance of DT. In this paper, we trade off the data updating cost and the performance of DT to adaptively determine the resource management and computation offloading in vehicular networks. Specifically, we propose a novel vehicle to vehicle pairing prediction algorithm assisted by DT to improve the offloading decision efficiency and investigate the effect of data updating frequency on prediction accuracy. Based on the prediction results, we formulate a joint data updating frequency selection, offloading decision and channel allocation problem with the objective of minimizing the computation and communication costs. To solve the formulated problem, we propose a prediction-based stability maximum pairing algorithm to obtain the proper task offloading strategy. Moreover, a deep Q-learning network algorithm is proposed to select the optimal DT data updating frequency according to the real-time vehicular network state. Based on the obtained optimal solution, we further propose an alternating direction method of multipliers-based iteration algorithm to optimize the computation and channel resource allocation and minimize the total costs. Numerical results are provided to validate the effectiveness and efficiency of our proposed algorithms.
5 September 2024 in IEEE Transactions on Network and Service Management
Network slicing has been envisioned to play a crucial role in supporting various vehicular applications with diverse performance requirements in dynamic Vehicle-to-Everything (V2X) communications systems. However, time-varying Service Level Agreements (SLAs) of slices and fast-changing network topologies in V2X scenarios may introduce new challenges for enabling efficient inter-slice resource provisioning to guarantee the Quality of Service (QoS) while avoiding both resource over-provisioning and under-provisioning. Moreover, the conventional centralized resource allocation schemes requiring global slice information may degrade the data privacy provided by dedicated resource provisioning. To address these challenges, in this paper, we propose a two-timescale resource management mechanism for providing diverse V2X slices with customized resources. In the long timescale, we propose a Proximal Policy Optimization-based multi-agent deep reinforcement learning algorithm for dynamically allocating bandwidth resources to different slices for guaranteeing their SLAs. Under the coordination of agents, each agent only observes its partial state space rather than the global information to adjust the resource requests, which can enhance the privacy protection. Moreover, an expert demonstration mechanism is proposed to guide the action policy for reducing the invalid action exploration and accelerating the convergence of agents. In the short-term time slot, with our proposed Cross Entropy and Successive Convex Approximation algorithm, each slice allocates its available physical resource blocks and optimizes its transmit power to meet the QoS. Simulation results show our proposed two-timescale resource allocation scheme for network slicing can achieve maximum 8.4% performance gains in terms of spectral efficiency while guaranteeing the QoS requirements of users compared to the baseline approaches.
27 November 2024 in IEEE Transactions on Intelligent Transportation Systems
As an emerging technology, Digital Twin (DT) can provide a virtual representation of transportation infrastructures to achieve efficient and precise management of Intelligent Transportation Systems (ITS). However, a mixed traffic scenario of coexisting intelligent connected vehicles (ICVs) and non-intelligent connected vehicles (N-ICVs) increases challenges for digital ITS. N-ICVs are unable to generate and update their DT models independently due to constrained communication and computing capabilities. It is crucial to achieve real-time DT model update and migration of N-ICVs. In this paper, we propose a cooperative perception aided DT model update and migration approach, which dispatches ICVs to cooperatively sense and transmit information of nearby N-ICVs to assist in generating N-ICVs’ DT models. In particular, with the objective of minimizing the average maximum weighted age of information (AMWAoI), we jointly optimize the cooperative ICV selection as well as the bandwidth and computation allocations while guaranteeing the perception performance. We then propose a sensing data weighted size maximization matching algorithm to achieve an optimal ICV selection strategy, and the bandwidth and computation allocations are optimized by the gradient descent algorithm. Considering the dynamic nature of vehicular networks, a deep reinforcement learning-based access selection and DT model migration algorithm is further proposed to achieve continuous service provisioning. Simulation results demonstrate that the proposed algorithm achieves the lowest AMWAoI while meeting the perception performance requirement.
10 January 2025 in IEEE Transactions on Vehicular Technology
Cooperative perception is a promising paradigm to tackle the perception limitations of a single intelligent vehicle (IV) to enhance the driving safety and efficiency in intelligent vehicular networks. However, the real-time transmission and computation-intensive fusion of raw sensing data raise new challenges for satisfying the stringent delay requirement of delay-sensitive applications. In this paper, we formulate a joint optimization problem of the cooperative IV selection, compression ratio selection, transmit power control, task offloading decision and computation allocation to minimize the end-to-end delay consisting of compression, transmission and computation. In particular, to meet the perception probability requirement, the quality and quantity-aware matching algorithm is proposed to optimize the cooperative IV selection. To guarantee the queue stability of offloading tasks, we develop the Lyapunov optimization algorithm to determine the upper bound of the offloading tasks and the corresponding optimal computation allocation. The Lyapunov aided deep reinforcement learning algorithm is further proposed to dynamically adjust the task offloading decision and compression ratio selection to minimize the end-to-end delay with the transmit power control being optimized by the successive convex approximation algorithm. Simulation results demonstrate that, compared to several benchmark algorithms, our proposed algorithm achieves the lowest end-to-end delay while guaranteeing the requirements on perception probability and queue stability effectively.