Stackelberg Game-Based Multi-Agent Algorithm for Resource Allocation and Task Offloading in MEC-Enabled C-ITS
Shubin Zhang, Xun Tong, Kaikai Chi, Wei Gao, Xiaolong Chen, Zhiguo Shi
Abstract
The rapid advancement of sixth-generation (6G) networks and artificial intelligence technologies is leading to the emergence of collaborative intelligent transportation systems (C-ITS), which is regarded as an essential trend in the future of transportation. Integrating Internet of Things (IoT) with C-ITS is an efficient solution to provide real-time data collection and status monitoring for vehicles and infrastructures to improve the intelligence and reliability of C-ITS. In order to address the challenges of limited battery energy and low computing power of IoT nodes, integrating wireless power transfer (WPT) with mobile edge computing (MEC) is considered as a promising solution to improve their lifetime and computational capability for IoT nodes. In this paper, we investigate a distributed dynamic computing offloading model for an MEC-enabled C-ITS, where multiple roadside units (RSUs) collaborate to provide offloading services to wireless devices (WDs). We formulate the task offloading and bandwidth resource allocation as a distributed Stackelberg game. The WDs act as leaders, aiming to maximize their computing rate by offloading tasks to RSU or performing local computing. The RSUs act as followers, optimizing their bandwidth allocation based on the WDs’ offloading decisions, thereby improving the overall system computing rate. We prove the existence of a Stackelberg equilibrium (SE) and propose a multi-agent reinforcement learning algorithm to enable WDs to select offloading decisions and help RSUs optimize bandwidth allocation. Numerical simulation results demonstrate that the proposed scheme offers significant performance improvements over existing methods.