Joint Access and Resource Allocation in Ultradense mmWave NOMA Networks With Mobile Edge Computing
Bibliographic record
Abstract
This article considers a two-tier heterogeneous network consisting of conventional sub-6-GHz macrocells along with millimeter-wave (mmWave) small cells, where mobile devices (MDs) can connect to either macrocell or small cells opportunistically via the nonorthogonal multiple access (NOMA) protocol. We employ the queuing theory in our network model to conduct an assessment on the execution delay, energy consumption and the total cost of offloading tasks in a mobile-edge computation offloading (MECO) system. The main goal is to design an energy-efficient MECO decision algorithm in an ultradense Internet of Thing (UD-IoT) network to analyze the tradeoff between execution delay and energy consumption. The proposed scheme jointly optimizes the communication and computation resource management, subject to the energy and delay constraints. Due to the mixed-integer nonlinear problem (MINLP) for resource allocation and computation offloading, an iterative algorithm along with the successive convex approximation (SCA) is proposed to achieve the optimum local frequency scheduling, power allocation, and computation offloading. The superior performance of the proposed MECO algorithm in our UD-IoT network is verified by the extensive numerical results.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| 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".