Exploiting Active STAR-RIS to Enable URLLC in Digitally-Twinned Internet-of-Things Networks
Bibliographic record
Abstract
In the context of ultra-reliable low-latency communication (URLLC) in Internet-of-Things (IoT) networks, conventional half-space coverage limits the flexibility of reconfigurable intelligent surface (RIS) deployment. To overcome these constraints, this paper makes use of active simultaneously transmitting and reflecting RIS (STAR-RIS), which is seamlessly integrated into digital twin (DT) and mobile edge computing (MEC) frameworks. Our primary research objective is to achieve full-space coverage by enabling simultaneous transmission and reflection of the signals while improving uplink data transmission from IoT URLLC user nodes (UNs) to the base station (BS) with the assistance of active STAR-RIS, even in the presence of imperfect channel state information (CSI). We formulate the problem of minimizing total end-to-end (e2e) latency, computed using the alternating optimization (AO) algorithm. Subsequently, we have evaluated the performance of the AO algorithm against the stochastic gradient descent (SGD) algorithm, which serves as the benchmark solution. The simulation outcomes delineate a performance evaluation under perfect and imperfect CSI scenarios. The AO algorithm outperforms SGD with latency reductions of 19.7% at$N=32$and 20.4% at$N=64$. Increasing N from 32 to 64 results in a 39.3% latency reduction for AO, surpassing SGD’s 38.8%. However, the SGD algorithm consistently exhibits lower computational complexity compared to the AO algorithm. Additionally, the energy splitting mode achieves the system’s total e2e latency reductions of 28.4% over the mode switching mode and 11.04% over time switching mode. Furthermore, active STAR-RIS optimal beamforming (ARO) achieves$\approx 10$% latency reduction over the predictive optimal beamforming (PRO), which itself surpasses active STAR-RIS with random beamforming (ARR) by$\approx 9$%. This comparison considers key factors such as the power budget, the number of RIS elements, the caching capacity of the edge computing server (ECS), the number of IoT UNs, the minimum transmission rate, and maximum transmit power at BS of active STAR-RIS.
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.001 |
| 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.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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 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".