Intelligent Digital Twin Communication Framework for Addressing Accuracy and Timeliness Tradeoff in Resource-Constrained Networks
Bibliographic record
Abstract
The accuracy and timeliness tradeoff prevents Digital Twins (DTs) from realizing their full potential. High accuracy is crucial for decision-making, and timeliness is equally essential for responsiveness. Therefore, this tradeoff in DT communication must be addressed to achieve DT synchronization. Previous studies identified the issue but considered the problem as maximizing data transfer, which is infeasible due to resource constraints. To facilitate this, we quantify accuracy and timeliness as E and$\phi $and define the problem as joint minimisation. We then introduce the Intelligent DT Communication (IDTC) Framework to solve the problem, which includes machine learning-based Predictive Synchronization (PS) and DT synchronization management (DTSYNC) protocol. Here, PS uses imputation and forecasting to generate future values, which are utilized to update DT at the projected time points. This mechanism of PS enables lowering E and$\phi $of the communication. Subsequently, we utilize the DTSYNC to control synchronization and optimise the twining frequency$f_{t}$. We evaluate the proposed framework using a public dataset and compare its performance with several state-of-the-art studies in a real-world scenario. Evaluation results indicate that IDTC outperforms the existing methods by 80% for E and 84% for$\phi $while enabling$f_{t}$adjustment, resulting in 3.8 times goodput improvement.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.006 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".