Digital-Twin-Aided Dynamic Spectrum Sharing and Resource Management in Integrated Satellite-Terrestrial Networks
Hung Nguyen-Kha, Vu Nguyen Ha, Ti Nguyen, Eva Lagunas, Joel Grotz, Symeon Chatzinotas, Björn Ottersten
TL;DR
This work tackles dynamic spectrum sharing in integrated satellite-terrestrial networks by leveraging a digital-twin (DT) framework that predicts traffic, environment, and CSI to guide resource management. It formulates two optimization problems—DT-JointRA (DT-prediction-based cycle-level decisions) and RT-Refine (real-time refinement of TN decisions)—and solves them with compressed-sensing relaxations and successive convex approximation to handle non-convex SINR and queue constraints. Using a London 3D map and real traffic data, the authors demonstrate significant congestion reduction and fast convergence, validating the practical feasibility of DT-driven RM for ISTNs. The study advances co-design of traffic steering, bandwidth allocation, and interference management under dynamic, heterogeneous service demands, offering a pathway toward robust, low-latency DSS in 6G ISTNs.
Abstract
The explosive growth in wireless service demand has prompted the evolution of integrated satellite-terrestrial networks (ISTNs) to overcome the limitations of traditional terrestrial networks (TNs) in terms of coverage, spectrum efficiency, and deployment cost. Particularly, leveraging LEO satellites and dynamic spectrum sharing (DSS), ISTNs offer promising solutions but face significant challenges due to diverse terrestrial environments, user and satellite mobility, and long propagation LEO-to-ground distance. To address these challenges, digitial-twin (DT) has emerged as a promising technology to offer virtual replicas of real-world systems, facilitating prediction for resource management. In this work, we study a time-window-based DT-aided DSS framework for ISTNs, enabling joint long-term and short-term resource decisions to reduce system congestion. Based on that, two optimization problems are formulated, which aim to optimize resource management using DT information and to refine obtained solutions with actual real-time information, respectively. To efficiently solve these problems, we proposed algorithms using compressed-sensing-based and successive convex approximation techniques. Simulation results using actual traffic data and the London 3D map demonstrate the superiority in terms of congestion minimization of our proposed algorithms compared to benchmarks. Additionally, it shows the adaptation ability and practical feasibility of our proposed solutions.
