MétaCan
Menu
Back to cohort
Record W4391014832 · doi:10.1002/9781394180523.ch8

NOMA Empowered Multi‐Access Edge Computing and Edge Intelligence

2024· other· en· W4391014832 on OpenAlexaff
Yuan Wu, Yang Li, Liping Qian, Xuemin Shen

Bibliographic record

Venuenot available
Typeother
Languageen
FieldComputer Science
TopicIoT and Edge/Fog Computing
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsEnhanced Data Rates for GSM EvolutionEdge computingComputer scienceNomaComputer networkArtificial intelligence

Abstract

fetched live from OpenAlex

Mobile edge computing (MEC) has been considered as a promising solution for enabling computation-intensive yet latency-sensitive applications at resource-constrained wireless devices. Due to the advanced non-orthogonal multiple access (NOMA) for next-generation wireless access networks, NOMA-empowered MEC enables a flexible and spectrum efficient multi-access task offloading approach in future heterogeneous small-cell networks. In this chapter, we first review the recent advances in NOMA-empowered MEC and edge intelligence. Then, as a concrete design example, we leverage the small-cell dual connectivity in heterogeneous small-cell networks and study a paradigm of dual computation offloading in which an edge-computing user can simultaneously offload partial workloads to a cloudlet server (CS) co-located at the macro base station and an edge server (ES) co-located at a small-cell based-station. To facilitate the multi-user dual computation offloading, we exploit a hybrid NOMA and frequency division multiple access (FDMA) transmission in which the edge users from the NOMA groups for offloading their respective workloads to different ESs at different small-cell base stations. Meanwhile, all users use FDMA for offloading their workloads to the CS at the macro base station. A joint optimization of the users' partial offloading decisions, the hybrid NOMA-FDMA transmission, as well as the processing rate allocations at the ESs and the CS, is formulated to minimize the overall task completion latency. An efficient algorithm is proposed to solve the joint optimization problem. Numerical results are provided to validate the effectiveness and efficiency of our proposed algorithms.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0020.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.043
GPT teacher head0.331
Teacher spread0.287 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreOther

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

Quick stats

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicIoT and Edge/Fog ComputingFrench-language works237,207