Digital twin-assisted multi-layer networks for low-latency and energy-efficient communication
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The sixth-generation (6G) wireless networks are expected to provide ubiquitous connectivity, high data rate, low latency, energy efficiency, and edge intelligence for Internet of Things (IoT) applications. Digital twin technology is a promising solution to enable multi-layer wireless networks that incorporate IoT devices on the ground, unmanned aerial vehicles (UAVs) as mobile edge computing (MEC) servers, and cloud servers. Multi-layer processing can handle time-sensitive and computationally intensive tasks from IoT devices. This paper proposes a digital twin-assisted multi-layer network for low-latency and energy-efficient communication and computation. We mathematically formulate an optimization problem to minimize the latency and energy consumption of IoT devices by optimizing their association with the UAV-MECs, computation resources, communication resources, and offloading portions of tasks. We propose a two-stage scheme based on the K-means method and the deep neural network approach to solve the above optimization problem. We compare the proposed two-stage scheme with existing schemes to highlight the scalability of the proposed solution. Simulation results demonstrate that the proposed multi-layer network achieved optimization results comparable to existing schemes with less computational cost, highlighting its usefulness in achieving low latency and energy-efficient computation and communication.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it