MétaCan
Menu
Back to cohort

Learning-Based Load-Aware Heterogeneous Vehicular Edge Computing

2022· article· en· W4315630242 on OpenAlexaff
Zhizhong Zhang, Peng Lin, Omair Shafiq, Yu Zhang, F. Richard Yu

Bibliographic record

VenueGLOBECOM 2022 - 2022 IEEE Global Communications Conference · 2022
Typearticle
Languageen
FieldComputer Science
TopicPrivacy-Preserving Technologies in Data
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer scienceEdge computingBottleneckDistributed computingRelayReinforcement learningComputation offloadingEdge deviceEnhanced Data Rates for GSM EvolutionComputationWirelessLatency (audio)Computer networkTask (project management)Load balancing (electrical power)Vehicular ad hoc networkCloudletCloud computingEmbedded systemWireless ad hoc networkArtificial intelligenceEngineeringTelecommunications

Abstract

fetched live from OpenAlex

Vehicular edge computing is an emerging enabler to support vehicular-based computation-intensive tasks. By reason of the time-varying vehicular wireless environments and the stochastic task generation, the dynamically unbalanced task load distribution among resource-constrained edge infrastructures leads to the performance bottleneck and low efficiency of computation resource utilization. We employ an aerial relay station that can establish relay connections between vehicles and nearby heterogeneous edge infrastructures to relieve this situation. The computation offloading strategy design in the multivehicle multi-edge infrastructure scenario that is closely linked to system latency performance will be particularly complicated. To address this issue, a model-free multi-agent reinforcement learning is adopted, and we propose a practical constraint in the problem formulation. Simulation experiments show that the proposed strategy can guarantee load balancing among edge infrastructures.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.013

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.000
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.044
GPT teacher head0.296
Teacher spread0.252 · 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 designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations7
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueGLOBECOM 2022 - 2022 IEEE Global Communications ConferenceSame topicPrivacy-Preserving Technologies in DataFrench-language works237,207