Computing Offloading for RIS-Aided Internet of Everything: A Cybertwin Version
Bibliographic record
Abstract
Cybertwin technology introduces a novel paradigm employing digital twins to model complex physical systems within a cyber environment, thus enhancing communication, collaboration, and decision-making capabilities. By harnessing advanced technologies, such as reconfigurable intelligent surfaces (RISs) and multiaccess edge computing (MEC), seamless interaction between physical and virtual entities is facilitated. In this article, we propose a cybertwin-driven edge computing framework that leverages RIS technology, complemented by an efficient computing offloading strategy to support large-scale Internet of Everything (IoE) applications. Specifically, the proposed strategy focuses on a multicell system where numerous randomly distributed end users have the option to offload delay-sensitive and computing-intensive tasks to edge computing nodes. The offloading channels are enhanced by RISs through passive beamforming, while cybertwin technology directs resource cooperation among multicells and allocates computing and communication resources. Our main objective is to optimize the system’s utility with respect to task completion latency and energy consumption reduction. To achieve this goal, we conduct the joint optimization of task offloading and resource allocation. Furthermore, we develop a joint task offloading and resource allocation (JTORA) algorithm to derive optimal solutions for passive beamforming design, computing offloading decisions, communication resource scheduling, and computing capacity allocation. The simulation results demonstrate the superiority of the proposed algorithm over benchmark schemes in terms of edge computing efficiency. Furthermore, the system utility can be further enhanced by increasing the number of embedded RIS elements.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 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".