Minimizing Communication Costs and Dropped Tasks via Dynamic Human Digital Twin Placement in MEC
Bibliographic record
Abstract
With the advent of 6G networks, digital twin (DT) systems have become critical for real-time monitoring, decisionmaking, and control across various sectors. A digital twin is a virtual representation of a physical twin (PT), enabling continuous interaction and data exchange. However, real-time communication between the DT and PT incurs variable costs as users change locations, significantly affecting system efficiency and user experience. In mobile environments, minimizing these communication costs is essential for maintaining DT performance, as increased latency and resource demands arise with user mobility. Consequently, an optimal dynamic placement strategy for DTs on edge servers is crucial to reducing communication overhead while ensuring responsiveness. This work introduces an optimization framework leveraging Lyapunov optimization to model and minimize communication costs between the Human digital twin (HDT) and PT, considering task drops during twin migration. The proposed solution dynamically adapts to user movements and network conditions, ensuring efficient real-time interactions with minimal costs. Evaluation results demonstrate the effectiveness of our approach in reducing communication costs and task drops while maintaining data exchange quality and reliability in 6G-enabled DT systems.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".