Pith. sign in

REVIEW 3 major objections 6 minor 36 references

This paper claims that a digital-twin-aided two-stage scheduler can bring mean queue length in an integrated satellite-terrestrial network to within about 0.25 MB of the full-information optimum while exchanging data with the satellite only

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-03 03:00 UTC pith:3NIH6D63

load-bearing objection Solid systems-engineering scheduler with an honest FIA control, but the DT-feasibility claim rests on an assumed error model and the MINLP local-optimality proof is deferred. the 3 major comments →

arxiv 2602.09191 v2 pith:3NIH6D63 submitted 2026-02-09 eess.SP

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\"orn Ottersten This is my paper
classification eess.SP
keywords digital twinintegrated satellite-terrestrial networksdynamic spectrum sharingresource allocationLEO satellitesqueue length minimizationsuccessive convex approximationcompressed sensing
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper aims to show that digital twin predicted information can drive dynamic spectrum sharing and resource allocation in integrated satellite-terrestrial networks without the heavy signaling of real-time channel estimation from LEO satellites. It formulates two problems: a DT-based joint RA (DT-JointRA) that optimizes long-term traffic steering, bandwidth allocation, and short-term association/power/RB assignments using predicted information, and a real-time refinement (RT-Refine) that re-optimizes terrestrial short-term decisions with actual CSI and traffic each subframe. The central result is that the refined scheduler lands within about 0.25 MB of an omniscient full-information algorithm while using only one satellite-ground round-trip per cycle, and beats benchmark algorithms by 5–17 MB in mean queue length. If true, this would make digital twins a practical mechanism for reducing congestion and signaling overhead in 6G NTN integration.

Core claim

The paper's central claim is that a two-stage optimization framework, DT-JointRA followed by RT-Refine, can nearly match the performance of a full-information omniscient scheduler (FIA) using only predicted digital-twin information plus subframe-level refinement of terrestrial decisions. The load-bearing numeric result is that with an interference margin κ=1.1, the gap between RT-Refine and FIA is about 0.25 MB in mean queue length (0.27 MB across power-budget sweeps), while the gain over the reference algorithm is about 5–5.7 MB and over greedy/heuristic schemes about 17 MB. The paper also claims Algorithm 2 converges to a local optimum of the joint RA problem (Proposition 4) and Algorithm

What carries the argument

The digital twin is the enabler: it combines a 3D map, ray tracing, TLE orbit data, and predicted UE positions/traffic to forecast channels and load. Binary association variables are relaxed through a compressed-sensing-style ℓ0-norm approximation (F_apx), and non-convex SINR/rate constraints are convexified via successive convex approximation with slack variables. An interference margin κ multiplies predicted inter-system interference terms in the refinement stage to guard against twin fidelity errors, which is what allows the refinement to operate with only actual terrestrial UE channels while keeping satellite channels predicted.

Load-bearing premise

The whole near-optimality result rests on the assumption that the digital twin's predicted channels and traffic are accurate enough — specifically, that real NLoS channels follow Eq. (8) with correlation ξ=0.5 to the twin's channels, and that next-cycle traffic equals the previous cycle's average; if actual twin error is worse than this, the 0.25 MB gap to the full-information optimum will grow.

What would settle it

Measure, in a real urban deployment, the actual correlation between digital-twin ray-traced channels and measured channels (e.g., with the authors' C-band setup). If the measured ξ is substantially below 0.5, or if traffic prediction error exceeds a previous-cycle average by a large margin, then running RT-Refine with κ=1.1 will not reproduce the claimed ~0.25 MB gap to FIA; the gap will exceed the reported value and may approach the benchmark gap.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • A network operator could run the joint RA on DT predictions and only refine terrestrial decisions at subframe level, cutting LEO signaling to one round-trip per cycle.
  • The near-zero gap to FIA suggests that, under the assumed twin fidelity, prediction error is almost fully compensated by the refinement stage; hence DT-based scheduling need not wait for perfect channel knowledge.
  • The algorithms satisfy delay-sensitive (D) service constraints in all tested cases, while heuristic and reference schemes leave 17.5–22.2% of D traffic unserved.
  • Because phase-2 refinement converges in about 3 iterations, the approach is compatible with subframe-level (1 ms) real-time operation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This is an editorial inference: the paper's assumed twin fidelity (ξ=0.5 for NLoS errors, and ξ=1 for the DT channel used in optimization) is not calibrated against the cited C-band measurement study; if real-world twin error is larger or less stationary than this model, the 0.25 MB gap to FIA would widen.
  • This is an editorial inference: the traffic predictor used in Algorithm 1 is a simple previous-cycle average; the framework's practical advantage may be sensitive to traffic non-stationarity, and a more sophisticated predictor could shrink or enlarge the gap depending on environment.
  • This is an editorial inference: the interference margin κ=1.1 is tuned empirically; in deployment, κ would need to be adaptively set from live error statistics to avoid either under- or over-protection.
  • This is an editorial inference: the compressed-sensing ℓ0 relaxation and SCA machinery are general; the same two-stage DT-plus-refine pattern could extend to other NTN/TN resource management problems, e.g., uplink or multi-satellite coordination.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper proposes a digital-twin-aided two-stage resource-management framework for an integrated satellite-terrestrial network sharing the 5G-NR C-band. A DT model combining a 3D map, ray tracing, and mobility/traffic prediction is used to obtain channel and traffic forecasts for the next cycle; the DT-JointRA algorithm solves an MINLP for bandwidth allocation, traffic steering, association, RB assignment, and power control using predicted information, and the RT-Reffine stage re-optimizes the TN short-term decisions at sub-frame granularity using real-time feedback. The objective is mean queue length. Simulations using a London 3D map and real traffic traces show that RT-Reffine comes within about 0.25–0.27 MB of the Full-Information Algorithm and outperforms greedy, heuristic, and reference benchmarks. Proposition 4 claims that Algorithm 2 converges to a local optimum of the original MINLP.

Significance. If the DT fidelity model is accepted as realistic, the optimization architecture is valuable: the Full-Information Algorithm is an honest upper-bound control, the kappa trade-off is mechanistically explained, and the SCA convexification steps in Propositions 1–3 are worked out in appendices. The paper is also among the first to couple 3D-map/ray-tracing DT channel prediction with dynamic spectrum sharing and a real-time refinement stage in ISTNs. However, the headline practical-feasibility claim rests on the assumed channel-error model in Eq. (8), and the current evaluation does not validate that model against independent measurements. The convergence guarantee for the MINLP is also not rigorously established. These are substantial but fixable issues; they do not undermine the optimization machinery itself.

major comments (3)
  1. [Section II-D4 and Section VI.A] The central practical-feasibility result is not validated against an independent ground truth. In Eq. (8), real NLoS channels are generated from DT channels as sqrt(xi) times the DT value plus a complex-normal error; Section VI.A states that the simulation environment is generated from the DT model with xi=0.5, while Algorithm 1 (line 4) predicts channels with xi=1, i.e., the predicted channel is exactly the DT channel. The prediction error in the simulation is therefore exactly the error distribution assumed in Eq. (8). The 0.25–0.27 MB gap between RT-Reffine and the Full-Information Algorithm (Figs. 11 and 12) is a direct function of this assumed model; it does not by itself demonstrate practical feasibility. The experimental C-band study [23] is cited but not used to calibrate xi or the error statistics. The authors should either calibrate Eq. (8) with measured ray-tracing/channel dat
  2. [Section IV.B, Proposition 4] Proposition 4 states that Algorithm 2 converges to a local optimum of the original MINLP (P0)_c, but the proof is not supplied in this manuscript and the argument given is insufficient. Deferring to Proposition 4 of [16] is not acceptable for a new, central claim. Moreover, the statement that 'the feasible set of (P2)_c is a subset of that of (P0)_c' is not meaningful as written: (P2)_c is a continuous SCA surrogate with l0-norm upper bounds and slack variables, while (P0)_c contains binary variables; the binary variables are recovered only after convergence by thresholding (36). A limit point of the continuous iterates need not be locally optimal for the mixed-integer problem, and the thresholding step can alter feasibility of the original constraints. The authors should either provide a rigorous mixed-integer local-optimality proof or weaken Proposition 4 to a statement about convergen
  3. [Section III.E and Eq. (28)] The traffic prediction used by the DT is simply the previous cycle's average (Eq. (28)), and no measure of traffic prediction error or its effect on QL is reported. Because the two-stage framework is specifically motivated by predicting future traffic and channels, the paper should quantify how the QL gap grows when the actual traffic differs from the previous-cycle average. This is load-bearing for the practical-feasibility claim, although less critical than the channel-fidelity issue in Major Comment 1.
minor comments (6)
  1. [Section VI.A] Only a single simulation scenario/trajectory is presented, with no error bars or multiple runs. Since the central differences are on the order of 0.25 MB, the authors should report run-to-run variability or state that the results are one representative realization.
  2. [Throughout] The manuscript contains numerous typos and OCR-like artifacts: 'digitial-twin' in the abstract, 'bechmarks' in Section V, 'heusistic' and 'algorihm' in Section VI, and 'Alg. 2 and ,' in Section V.D. A careful copyedit is needed.
  3. [Section III] The symbol S is used both for the set of services and for the SatCom service, causing confusion in expressions such as K = K_D ∪ K_S ∪ K_M, L, S. Consider renaming the service set to avoid the clash.
  4. [Table II] The column 'Remaining D traffic (%)' is not defined. Please specify whether it is the percentage of unserved D-service bits over total D arrivals, per cycle or averaged, and state how N_SC^D is selected for the comparisons.
  5. [Fig. 10] The y-axis label 'Average percentage' is vague. Clarify that the two plotted quantities are the mean QL reduction by phase 2 relative to phase 1 and the mean QL gap relative to the Full-Information Algorithm, respectively.
  6. [Eq. (13)] The definition of xi_D after Eq. (13) appears garbled; check the formula for the finite-blocklength penalty term to ensure the notation is consistent.

Circularity Check

1 steps flagged

DT channel prediction is self-referential: the simulated 'real' channels are generated from the same twin model (Eq. 8, ξ=0.5) that Algorithm 1 uses as its prediction (ξ=1), so the reported near-FIA gap reflects the assumed error model rather than measured DT fidelity.

specific steps
  1. self definitional [Section II-D4, Eq. (8); Algorithm 1, Step 4; Section VI.A (Simulation Setup)]
    "The relationship between real and virtual NLoS components is modeled as ˜h nl ℓ,k = √ ξ ¯h nl ℓ,k + √(1−ξ) eℓ,k and ˜g nl k = √ ξ ¯g nl k + √(1−ξ) e0,k, (8) ... Algorithm 1: Construct { ˆg c, ˆh c} by using chan c with ξ = 1. ... Environment channels are generated using the DT model with coefficient ξ = 0.5."

    The simulated 'real' channel is constructed from the same virtual channel that the DT predicts. Algorithm 1 predicts channel gains using the RayT virtual channel with ξ=1, i.e., the prediction is exactly the twin's virtual channel. The simulation then generates the real environment from Eq. (8) with ξ=0.5, so the real channel is a fixed linear mixture of the predicted virtual channel plus an assumed complex-normal error. Therefore the prediction error in the simulation is not measured or externally validated; it is exactly the error distribution assumed in Eq. (8). The central practical-feasibility results—the 0.25–0.27 MB gap between RT-Reffine and FIA and the ~15.7% phase-2 refinement gain at ξ=0.5—are direct functions of this assumed ξ and error statistics. The experimental C-band study

full rationale

The optimization core is largely independent: the compressed-sensing l0-surrogate and SCA machinery, the two-stage DT-JointRA/RT-Reffine decomposition, and the FIA benchmark are self-contained and do not reduce to the channel model. The FIA comparison honestly separates the prediction loss from algorithmic performance. However, the load-bearing practical-feasibility claim is not independently validated. The simulation generates its ground-truth channels from Eq. (8), the very DT model whose output is used as the prediction, with ξ=0.5 in the environment and ξ=1 in Algorithm 1. Thus the reported near-FIA gap is a direct consequence of the assumed twin-replica error, not of measured ray-tracing accuracy. The paper does not calibrate ξ or the error statistics against the cited experimental C-band study [23], so this part of the claim is circular in the sense that the 'real' system is defined from the predictor. The self-citation to [16] in Proposition 4 is not load-bearing enough to raise the score further: the proof also invokes standard SCA convergence [31] and outlines the monotone-bounded argument. Overall, partial circularity: the algorithmic contribution stands, but the headline DT-fidelity result reduces by construction to an assumed error model.

Axiom & Free-Parameter Ledger

4 free parameters · 7 axioms · 0 invented entities

The free parameters are few but load-bearing: kappa tunes the headline gain and xi defines the DT error model; both are set on or for the evaluated scenario. The axioms are mostly standard telecom modeling assumptions; the ad hoc ones (Eq. 8 correlation model, Eq. 28 averaging predictor) are exactly what set the claimed practical feasibility. The digital twin is a software replication construct, not a new physical entity, so no graviton-type invented entities apply.

free parameters (4)
  • Interference margin kappa = 1.1
    Swept in Fig. 11 and selected because it minimizes mean QL on the test scenario (3.51 MB at kappa=1.1 vs 3.59 at kappa=1, 3.53 at 1.2); all remaining results use kappa=1.1. Tuning on the evaluated scenario supports the reported RT-Refine gains (0.75 MB refinement gain; 0.25-0.27 MB gap to FIA).
  • DT correlation coefficient xi = 0.5
    Chosen, not measured, to generate 'real' channels from the DT replica via Eq. (8). Because Algorithm 1 predicts channels with xi=1, the entire DT-error magnitude—and hence the RT-Refine vs FIA gap (14.5% to 6.9% QL gap as xi goes 0.3 to 0.7)—is determined by this assumed parameter.
  • Benchmark D-service SC count N_SC^D = 1
    Selected from Table II to minimize the benchmark's mean QL (20.12 MB at N_SC=1 vs 37.29 MB at N_SC=5). This choice favors the benchmarks, but it is still a hand-set comparison parameter.
  • l0-norm approximation scale epsilon = epsilon << 1 (not specified numerically)
    Algorithm parameter in F_apx(x)=1-e^{-x/epsilon} (Eqs. 32-33) and in the binary recovery thresholds (Eq. 36). Its value and sensitivity are not reported.
axioms (7)
  • domain assumption TAPs can perfectly estimate CSIs of their served UEs each frame via uplink pilots
    Invoked in Section II-C to build g* in the refinement stage; optimistic for dense urban C-band with fast vehicle mobility.
  • domain assumption LSat position is predicted with negligible error (Section II-D3)
    Relies on TLE orbital stability; plausible but unquantified.
  • ad hoc to paper NLoS mismatch between real and DT channels follows Eq. (8): real NLoS = sqrt(xi)*DT NLoS + sqrt(1-xi)*error with complex-normal error and xi in (0,1)
    This linear-correlation model is postulated; its realism governs the headline DT-vs-FIA gap and it is never validated against measurements.
  • ad hoc to paper Next-cycle traffic equals the previous cycle's average (Eq. 28)
    The DT 'prediction' of traffic is a lagged average; no trend or periodicity modeling, and this defines the traffic replica used in DT-JointRA.
  • domain assumption Channel dispersion V is approximately 1 for SINR >= 5 dB
    Finite-blocklength approximation imported from [30], used in the D-service rate (Eqs. 12-13) and enforced by constraint (C10).
  • domain assumption Rician fading with LoS/NLoS split, antenna patterns from [34],[35], and the ray-tracing tool faithfully computes DT channels (Eq. 7)
    The twin's channel prediction quality is inherited from the ray-tracing tool and 3D map as in the authors' prior [16], without independent validation here.
  • standard math SCA local-optimality machinery of [31] (Beck et al.) applies to the sequential convex problems
    Invoked by Propositions 4-5; the paper's actual convergence-to-local-optimum claim additionally needs the MINLP binary-recovery argument, which is not supplied.

pith-pipeline@v1.3.0-alltime-deepseek · 40274 in / 20485 out tokens · 181352 ms · 2026-08-03T03:00:50.684746+00:00 · methodology

0 comments
read the original 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.

Figures

Figures reproduced from arXiv: 2602.09191 by Bj\"orn Ottersten, Eva Lagunas, Hung Nguyen-Kha, Joel Grotz, Symeon Chatzinotas, Ti Nguyen, Vu Nguyen Ha.

Figure 1
Figure 1. Figure 1: Digital-twin-aided ISTNs. ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... frame e frame (e-1) frame (e+1) ... ... c-1 c c+1 ...... Time Frequency ... ... D 1 ... ... ... M 1 2 ... ... ... S 1 4 TN DL sub-frames TN UL sub-frames BWP D BWP M BWP S [PITH_FULL_IMAGE:figures/full_fig_… view at source ↗
Figure 2
Figure 2. Figure 2: Resource block grid. such as uRLLC, exclusively served by TAPs; (ii) SatCom (S), provided solely by the LSat; and (iii) Multinet (M) supported by both TAPs and LSat. The sets of UEs associated with these three services are denoted as KD, KS, and KM, respectively. The total BW is dynamically divided into three BW parts (BWPs) for these three services. Each BWP employs a 5G￾NR numerology, i.e., D, M, and S, … view at source ↗
Figure 3
Figure 3. Figure 3: Summary of the DT-system. where ℓ, and 0, indicate errors caused by the absence of map information, which are assumed as complex normal random variables. ∈ (0, 1) is the correlation factor. III. DT-BASED OPTIMIZATION PROBLEM FORMULATION A. User Association Let = [ [x,x ] ℓ, ] be the binary association variable for x ∈ {D, M} where [x,x ] ℓ, = 1 if APℓ served UEk over RB[vx,nx ] for DL and [x,x ] ℓ, = 0 oth… view at source ↗
Figure 4
Figure 4. Figure 4: Traffic steering model. Θ Sat,[M,M ] [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Developing workflow. Algorithm 1 DT-BASED PREDICTION 1: Input: Actual information {−1, ue −1 , TLE−1 } in cycle ( − 1). 2: Predict {ˆ ue [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Flowchart of the proposed DT-based algorithm. [PITH_FULL_IMAGE:figures/full_fig_p009_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Data exchange in DT-based algorithm. D. RT-Refine Algorithm Implementation Regarding implementation, [PITH_FULL_IMAGE:figures/full_fig_p009_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Simulation scenario, TN channel heatmap (log10 scal [PITH_FULL_IMAGE:figures/full_fig_p010_8.png] view at source ↗
Figure 11
Figure 11. Figure 11: depicts the mean QL versus interference margin in the RT-Refine algorithm. One can see that the mean QL outcome first decreases and then increases as in￾creases. Particularly, the mean QL at = (1, 1.1, 1.2, 1.3) is about (3.59, 3.51, 3.53, 3.63) MB. This phenomenon can be explained as follows. First, one notes that in phase 2 of the RT-Refine algorithm, only actual channels from TAPs to their own served U… view at source ↗
Figure 10
Figure 10. Figure 10: QL versus DT channel coefficient, . algorithm and phase 2-the refinement stage, which operate on different input types, i.e., predicted and actual information, respectively. Since the DT-JointRA algorithm and FIA share the same structure with only differences in inputs, their conver￾gence rates are similar. Particularly, the DT-JointRA algorithm and FIA require only about 25 iterations for convergence in … view at source ↗
Figure 13
Figure 13. Figure 13: QL versus LSat power budget. 0 5 10 15 20 25 30 35 40 45 50 55 60 65 70 75 80 85 90 95 100 0 20 40 60 80 Time frame index, e Queue length (MB) RT-Refine Alg. Full-Info Alg. Ref Alg. Heuristic Alg [PITH_FULL_IMAGE:figures/full_fig_p012_13.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

36 extracted references

  1. [1]

    Dt-aided resource management in spectrum sharin g integrated satellite-terrestrial networks,

    H. Nguyen-Kha, V . N. Ha, T. Nguyen, E. Lagunas, S. Chatzin otas, and J. Grotz, “Dt-aided resource management in spectrum sharin g integrated satellite-terrestrial networks,” in IEEE GLOBECOM , 2025

    2025

  2. [2]

    On the road to 6G: Visions, requirements, key technologies, and testbeds,

    C.-X. Wang et al. , “On the road to 6G: Visions, requirements, key technologies, and testbeds,” IEEE Commun. Surveys Tut. , vol. 25, no. 2, pp. 905–974, Secondquarter 2023

    2023

  3. [3]

    Non-terrestrial networks, a native component of 6g: Vision on non-terrestrial networks in 6g system (or imt-2030),

    ETSI, “Non-terrestrial networks, a native component of 6g: Vision on non-terrestrial networks in 6g system (or imt-2030),” 2024

    2030

  4. [4]

    Single network future: Supplemental coverage fro m space,

    FCC, “Single network future: Supplemental coverage fro m space,” 2023

    2023

  5. [5]

    Direct-to-device connectivity: An opportunity f or europe,

    ESA, “Direct-to-device connectivity: An opportunity f or europe,” 2024

    2024

  6. [6]

    Study on complementary reuse of terrestrial spec trum in satellite deployments,

    3GPP , “Study on complementary reuse of terrestrial spec trum in satellite deployments,” Tdoc RWS-230110, 2023, TSG RAN R19 Workshop

    2023

  7. [7]

    Simplifying 5G with a network digit al twin,

    S. Communications, “Simplifying 5G with a network digit al twin,” 2019, white paper

    2019

  8. [8]

    Digi tal twin for 5g and beyond,

    H. X. Nguyen, R. Trestian, D. To, and M. Tatipamula, “Digi tal twin for 5g and beyond,” IEEE Commun. Mag. , vol. 59, no. 2, pp. 10–15, 2021

    2021

  9. [9]

    Toward real-time digital twins of em environments: Computational benchmark for ray launching software,

    M. Zhu et al. , “Toward real-time digital twins of em environments: Computational benchmark for ray launching software,” IEEE OJCOM , vol. 5, pp. 6291–6302, 2024

    2024

  10. [10]

    Auctio n design and analysis for SDN-based traffic offloading in hybrid satellit e-terrestrial networks,

    J. Du, C. Jiang, H. Zhang, Y . Ren, and M. Guizani, “Auctio n design and analysis for SDN-based traffic offloading in hybrid satellit e-terrestrial networks,” IEEE JSAC. , vol. 36, no. 10, pp. 2202–2217, Oct. 2018

    2018

  11. [11]

    Resource allocation in terrestrial-satellite-based ne xt generation multiple access networks with interference coo peration,

    Y . Zhang et al. , “Resource allocation in terrestrial-satellite-based ne xt generation multiple access networks with interference coo peration,” IEEE J. Sel. Areas Commun. , vol. 40, no. 4, pp. 1210–1221, Apr. 2022

    2022

  12. [12]

    Interference mitigation for reverse spectrum sharin g in B5G/6G satellite-terrestrial networks,

    H.-W. Lee, C.-C. Chen, S. Liao, A. Medles, D. Lin, I.-K. F u, and H.-Y . Wei, “Interference mitigation for reverse spectrum sharin g in B5G/6G satellite-terrestrial networks,” IEEE Trans. V eh. Technol., pp. 1–16, 2023

    2023

  13. [13]

    Dynamic multip le access based on RSMA and spectrum sharing for integrated satellite -terrestrial networks,

    Z. Li, S. Han, M. Peng, C. Li, and W. Meng, “Dynamic multip le access based on RSMA and spectrum sharing for integrated satellite -terrestrial networks,” IEEE Trans. Wireless Commun. , vol. 23, no. 6, 2024

    2024

  14. [14]

    Coordina ted dynamic spectrum sharing between terrestrial and non-terrestrial networks in 5g and beyond,

    H. Martikainen, M. Majamaa, and J. Puttonen, “Coordina ted dynamic spectrum sharing between terrestrial and non-terrestrial networks in 5g and beyond,” in IEEE 24th Int. W oWMoM , June 2023, pp. 419–424

    2023

  15. [15]

    Beam management in low earth orbit satellite communication with handover frequency control a nd satellite- terrestrial spectrum sharing,

    J. Zhu, Y . Sun, and M. Peng, “Beam management in low earth orbit satellite communication with handover frequency control a nd satellite- terrestrial spectrum sharing,” IEEE Trans. Commun. , pp. 1–1, 2024

    2024

  16. [16]

    Enhanced throughput and seamless handover solut ions for urban 5g-vehicle c-band integrated satellite-terrestria l networks,

    H. Nguyen-Kha, V . Nguyen Ha, E. Lagunas, S. Chatzinotas , and J. Grotz, “Enhanced throughput and seamless handover solut ions for urban 5g-vehicle c-band integrated satellite-terrestria l networks,” IEEE Trans. Commun., vol. 73, no. 11, pp. 12 836–12 853, 2025

    2025

  17. [17]

    URLLC edge networks with joint o ptimal user association, task offloading and resource allocation: A digital twin approach,

    D. V an Huynh and et al., “URLLC edge networks with joint o ptimal user association, task offloading and resource allocation: A digital twin approach,” IEEE Trans. Commun., vol. 70, no. 11, pp. 7669–7682, 2022

    2022

  18. [18]

    Dynamic dig ital twin and distributed incentives for resource allocation in aerial-assisted internet of vehicles,

    W. Sun, P . Wang, N. Xu, G. Wang, and Y . Zhang, “Dynamic dig ital twin and distributed incentives for resource allocation in aerial-assisted internet of vehicles,” IEEE IoT J. , vol. 9, no. 8, pp. 5839–5852, 2022

    2022

  19. [19]

    Resource allocation for integrated sensing and communication in digital twin en abled internet of vehicles,

    Y . Gong, Y . Wei, Z. Feng, F. R. Y u, and Y . Zhang, “Resource allocation for integrated sensing and communication in digital twin en abled internet of vehicles,” IEEE Trans. V eh. Technol., vol. 72, no. 4, 2023

    2023

  20. [20]

    In- tegrated resource collaboration for ris-assisted digital -twin-empowered internet of everything,

    M. Wu, Y . Gao, Q. Song, K. Li, W. Lu, L. Guo, and A. Jamalipo ur, “In- tegrated resource collaboration for ris-assisted digital -twin-empowered internet of everything,” IEEE IoT J. , vol. 12, pp. 23 275–23 287, 2025

    2025

  21. [21]

    Optimizing wi reless resource management and synchronization in digital twin ne tworks,

    H. Y u, Y . Liu, Z. Y ang, H. Sun, and M. Chen, “Optimizing wi reless resource management and synchronization in digital twin ne tworks,” IEEE IoT J. , vol. 12, no. 15, pp. 29 152–29 163, 2025

    2025

  22. [22]

    Dynamic slice resource management and information synchronization strategy in iov based on digital twin,

    L. Tang et al. , “Dynamic slice resource management and information synchronization strategy in iov based on digital twin,” IEEE Trans. Intelligent Transportation Systems , vol. 26, no. 5, pp. 6635–6650, 2025

    2025

  23. [23]

    An experimental study of C-band channel model in integrated LE O satellite and terrestrial systems,

    H. Nguyen-Kha, V . N. Ha, E. Lagunas, S. Chatzinotas, and J. Grotz, “An experimental study of C-band channel model in integrated LE O satellite and terrestrial systems,” in Proc. MeditCom 2024 , 2024

    2024

  24. [24]

    D2.5 report on regulatory requ irements: Spectrum policies and regulatory analysis,

    Chee, Tommy and others , “D2.5 report on regulatory requ irements: Spectrum policies and regulatory analysis,” 2024, 6G-NTN p roject

    2024

  25. [25]

    In- telligent traffic steering in beyond 5g open ran based on lstm traffic prediction,

    F. Kavehmadavani, V .-D. Nguyen, T. X. Vu, and S. Chatzin otas, “In- telligent traffic steering in beyond 5g open ran based on lstm traffic prediction,” IEEE Trans. Wireless Commun. , vol. 22, no. 11, 2023

    2023

  26. [26]

    Inter-num erology interference for beyond 5g,

    A. B. Kihero, M. S. J. Solaija, and H. Arslan, “Inter-num erology interference for beyond 5g,” IEEE Access , vol. 7, 2019

    2019

  27. [27]

    Joint power and resource block allocation for mixed-numer ology-based 5g downlink under imperfect csi,

    P . K. Korrai, E. Lagunas, A. Bandi, S. K. Sharma, and S. Ch atzinotas, “Joint power and resource block allocation for mixed-numer ology-based 5g downlink under imperfect csi,” IEEE OJCOM, pp. 1583–1601, 2020

    2020

  28. [28]

    NR; Physical channels and modulation,

    3GPP , “NR; Physical channels and modulation,” Technic al specification (TS) 38.211, Dec. 2023, version 18.1.0

    2023

  29. [29]

    Channel Coding Rate in the Finite Blocklength Regime,

    Y . Polyanskiy, H. V . Poor, and S. V erdu, “Channel Coding Rate in the Finite Blocklength Regime,” IEEE Transactions on Information Theory , vol. 56, no. 5, pp. 2307–2359, May 2010

    2010

  30. [30]

    Delay analys is for wireless fading channels with finite blocklength channel coding,

    S. Schiessl, J. Gross, and H. Al-Zubaidy, “Delay analys is for wireless fading channels with finite blocklength channel coding,” in Proc. 18th ACM MSWiM. Cancun Mexico: ACM, Nov. 2015, pp. 13–22

    2015

  31. [31]

    A sequential parametric convex approximation method with applications to nonconve x truss topology design problems,

    A. Beck, A. Ben-Tal, and L. Tetruashvili, “A sequential parametric convex approximation method with applications to nonconve x truss topology design problems,” J. Global Optimization , vol. 47, pp. 29–51, May 2010

    2010

  32. [32]

    Interior point polynomial time m ethods in convex programming,

    Nemirovski, Arkadi, “Interior point polynomial time m ethods in convex programming,” lecture notes 42.16 (2004): 3215-3224

    2004

  33. [33]

    Twinning commercial network traces on expe rimental open ran platforms,

    L. Bonati, R. Shirkhani, C. Fiandrino, S. Maxenti, S. D’ Oro, M. Polese, and T. Melodia, “Twinning commercial network traces on expe rimental open ran platforms,” in Proc. MobiCom. ACM, Dec., p. 1914–1921

    1914

  34. [34]

    Solutions for NR to support non-terrestrial net works (NTN): Non-terrestrial networks (NTN) related RF and co-existenc e aspects,

    3GPP , “Solutions for NR to support non-terrestrial net works (NTN): Non-terrestrial networks (NTN) related RF and co-existenc e aspects,” Technical Specification (TS) 38.863, Dec. 2023, 18.0.0

    2023

  35. [35]

    Solutions for NR to support non-terrestrial netwo rks,

    ——, “Solutions for NR to support non-terrestrial netwo rks,” Technical report (TR) 38.821, March 2023, version 16.2.0

    2023

  36. [36]

    Seamless 5g automotive connectivity with integrated sate llite terrestrial networks in c-band,

    H. Nguyen-Kha, V . N. Ha, E. Lagunas, S. Chatzinotas, and J. Grotz, “Seamless 5g automotive connectivity with integrated sate llite terrestrial networks in c-band,” in 2024 IEEE 100th VTC-Fall , 2024, pp. 1–5

    2024