Digital Twin-Assisted Load-Balanced User Association and AoI-Aware Scheduling in IoT Networks
Bibliographic record
Abstract
In this paper, we propose a digital twin (DT) assisted-user device (UD)-base station (BS) association for cellular-supported internet of things (IoT) networks, and scheduling of uplink transmission of these devices to their associated BSs considering the age of information (AoI). Unlike existing work, we consider the scenario of a main base station (MBS) and several smaller base stations (SBSs), which is suitable for 5G and beyond 5G technology. We propose a novel Q-learning-inspired algorithm for simultaneous uplink throughput maximization and load balancing among the different BSs to associate the UDs away from the MBS and distribute them evenly between the SBSs as much as possible. We further take into account the maximum UD-association limit and limited coverage radius of each BS, which makes it closer to a realistic scenario. Another contribution is the proposal and analysis of heuristics-based scheduling of the UDs transmission to their respective BSs with the aim to reduce the overall AoI. Scheduling is important as many applications in the IoT networks require near-time or near-real-time updates for taking timely decisions and maintaining acceptable performance and safety levels. The AoI is an effective metric for the timeliness of information at a receiver, and the computational simplicity of the heuristics-based approach ensures that the scheduling decisions are taken promptly. Simulations results and comparison with several benchmark methods show that the proposed solution can achieve load balancing with a slight degradation in the cumulative maximum achievable throughput achieved in the network. The results also provide valuable insights into the joint performance of the proposed model and the benchmark UD-BS association and scheduling solutions with different packet generation rates for transmission by the UDs.
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 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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".