In digital twins enabled space-air-ground integrated networks (DT-SAGINs), the DT of a vehicle (DT-V) needs to constantly migrate between the infrastructures deployed on the path of the vehicle as the vehicle moves to provide stable and continuous driving services for the vehicle. However, each DT-V has differentiated migration requirements and the heterogeneous network infrastructures have various migration performances. Therefore, how to design a scheme that jointly considers the above factors to determine the optimal migration strategy for each DT-V becomes a challenge. In this paper, we propose a game-based migration scheme for the DT-Vs in DT-SAGINs. In this scheme, we first design a two-layer DT migration architecture, where each vehicle has two DTs and each network infrastructure only has one DT. The two DTs of the vehicle are respectively deployed in the cloud layer (Primary DT-V) and the edge layer (Second DT-V). In contrast, the DT of each network infrastructure is deployed in the cloud layer (DT-I). Based on the designed architecture, the interaction of the Primary DT-Vs and the DT-Is deployed in the cloud layer is formulated as a matching game, where an integrated algorithm that couples bilateral matching and dynamic programming is designed to obtain the optimal migration strategy for each Second DT-V deployed in the edge layer to maximize its average utility. The simulation results show that the proposed scheme can lead to a higher utility for each Second DT-V than the conventional schemes.
Zhihan LyuDongliang ChenHaibin Lv
Yilu CaoZiye JiaChao DongYanting WangJiahao YouQihui Wu
Feng WangDingde JiangSheng QiQiao Chen
Feihu DongJiaxin SongYasheng ZhangYuqi WangTao Huang
Yilong HuiYi QiuZhou SuZhisheng YinTom H. LuanKhalid Aldubaikhy