MétaCan
Menu
Back to cohort
Record W2967263386 · doi:10.1109/lwc.2019.2934453

Delay Minimization for NOMA-Assisted MEC Under Power and Energy Constraints

2019· article· en· W2967263386 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Wireless Communications Letters · 2019
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Technologies
Canadian institutionsMemorial University of Newfoundland
FundersNatural Sciences and Engineering Research Council of CanadaNational Science Foundation
KeywordsNomaTime division multiple accessComputer scienceMinificationEnergy (signal processing)Constraint (computer-aided design)Reduction (mathematics)Mobile edge computingPower (physics)Enhanced Data Rates for GSM EvolutionComputer networkMathematical optimizationTelecommunicationsTelecommunications linkMathematics

Abstract

fetched live from OpenAlex

This letter considers delay minimization for offloading in a mobile edge computing network with multiple users. We first show that under the same power constraint, using non-orthogonal multiple access (NOMA) can reduce the overall delay compared with time-division multiple access (TDMA). However, in this case, NOMA also consumes more energy. To ensure a fair comparison, we also consider the case when NOMA and TDMA are constrained by the same energy. Depending on the available energy, three scenarios are identified, and the corresponding optimal strategies are introduced. Simulations are conducted, showing that the proposed NOMA scheme can achieve substantial delay reduction compared with TDMA.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.707
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.017
GPT teacher head0.238
Teacher spread0.222 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it