When Mobile-Edge Computing (MEC) Meets Nonorthogonal Multiple Access (NOMA) for the Internet of Things (IoT): System Design and Optimization
Bibliographic record
Abstract
Mobile-edge computing (MEC) is considered as a promising technology to enable low latency applications while consuming less energy, and nonorthogonal multiple access (NOMA) is regarded as a hopeful method of increasing spectrum efficiency and the wireless network capacity. In this article, we consider a NOMA-MEC-based Internet-of-Things (IoT) network, and propose a joint optimization framework to maximize the effective system capacity, i.e., the number of IoT devices whose tasks are processed successfully, and meanwhile to maximize the total energy saving. First, we concentrate on improving the effective system capacity from the wireless side by introducing NOMA, and from the IoT device side by task offloading decision optimization, where distributed optimization is conducted and closed-form solution is obtained. Then, we maximize the total energy saving also from two aspects, i.e., the device-side computation resource allocation, and the wireless side joint admission control, user clustering, orthogonal subcarrier assignment, and transmit power control, where we resort to graph theory and propose a low-complexity heuristic algorithm to solve it. Abundant simulation results demonstrate our proposed joint optimization algorithm performs well in both effective system capacity optimization and energy saving maximization.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".