Delay Minimization for Massive MIMO Assisted Mobile Edge Computing
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 envisioned as a promising technology for enhancing the computational capacities of mobile devices, by enabling computational task offloading. In this article, we employ massive multiple-input multiple-output methods to facilitate offloading in MEC. Our objective is to minimize the maximum delay for offloading and computing among the users, which requires a joint allocation of wireless and computational resources. Both perfect and imperfect channel state information (CSI) are considered. Under perfect CSI, we derive a semi-closed-form solution for the formulated problem. Under imperfect CSI, since the formulated problem is non-convex, we transform it into a convex one using a successive convex approximation technique and propose an iterative algorithm to solve it. Presented numerical results show the benefits of having a large number of antennas at the base station, and the necessity of performing joint radio and computational resource allocation.
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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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 it