Reconfigurable Intelligent Surface-Assisted Secure Mobile Edge Computing Networks
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
Mobile edge computing (MEC) has been recognized as a viable technology to satisfy low-delay computation requirements for resource-constrained Internet of things (IoT) devices. Nevertheless, the broadcast feature of wireless electromagnetic communications may lead to the security threats to IoT devices. In order to enhance the task offloading security, this paper proposes a reconfigurable intelligent surface (RIS)-assisted secure MEC network framework. Furthermore, we investigate the max-min computation efficiency problem under the secure computation rate requirements, by jointly optimizing the local computing frequencies and transmission power of IoT devices, time-slot assignment, and phase beamforming of the RIS. To solve the formulated non-convex problem, we further develop an iterative algorithm, in which the Dinkelbach-type method and block coordinate descent (BCD) technique are utilized to tackle the fractional objective function and coupled optimization variables, respectively. In particular, the successive convex approximation (SCA) and penalty function-based methods are exploited to solve the transmit power control and reflecting beamforming optimization subproblems, respectively, and the closed-form expression for local computing frequencies optimization subproblem is derived. Numerical results quantify the performance gain achieved by the proposed RIS-assisted secure MEC networks, when compared to existing benchmark methods.
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.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.002 |
| 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