Latency Minimization in Phase-Coupled STAR-RIS Assisted Multi-MEC Server Systems
Bibliographic record
Abstract
In this paper, we consider a simultaneous transmitting and reflecting (STAR)-reconfigurable intelligent surface (RIS)-assisted multi mobile-edge-computing (MEC) system, where servers can be placed on both sides of the STAR-RIS and each device offloads a part of its computational tasks to the MEC servers. Specifically, we formulate a weighted-sum computing and communication latency minimization problem to jointly optimize the offloading data volume, edge computing resource of servers, multi-user detection (MUD) matrices, as well as energy splitting coefficients and phase-shifts of the STAR-RIS in the presence of coupling between transmission and reflection phase shifts. Using block coordinate descent (BCD), we decompose the computing and communication problems and solve them in an iterative manner through alternating optimization. We show that the optimal offloading volume can be given by establishing the equivalence of the local computing latency and edge computing latency of servers. Also, we proved that the edge resource allocation problem is jointly convex in both the transmit and reflect MEC resources. Therefore, the optimal MEC resources can be found using KKT conditions and the bisection search method. Numerical results demonstrate the effectiveness of the proposed STAR-RIS-enabled multi-MEC system in terms of obtained latency and convergence compared to the conventional benchmarks.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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".