MétaCan
Menu
Back to cohort

Multi-Armed Bandit-Aided Near-Optimal Over-The-Air Updates in Multi-Band V2X Systems

2023· article· en· W4385804701 on OpenAlexaff
Sherief Hashima, Mostafa M. Fouda, Kohei Hatano, Eiji Takimoto, Zubair Md. Fadlullah

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldDecision Sciences
TopicAdvanced Bandit Algorithms Research
Canadian institutionsWestern University
FundersJapan Society for the Promotion of Science London
KeywordsPayload (computing)Computer scienceDisseminationComputer networkHeuristicCacheBase stationReal-time computingTelecommunicationsNetwork packet

Abstract

fetched live from OpenAlex

As autonomous and connected vehicles continue to garner much research attention, the automotive Over-The-Air (OTA) updates recently emerged as an important research topic. OTA is crucial to disseminate critical updates for safety and stability of on-board sensing and operational systems. In beyond 5G(BSG) systems, OTA may be regarded as cached and a service provided by cellular base stations and roadside units (RSUs). However, for large-size OTA dissemination, the Electronic Control Units (ECUs) of vehicles need to download scheduled segments of the OTA payload from the serving RSU in an opportunistic manner, i.e., while stopping at the traffic signal or waiting in traffic. To maximize the downloadable payload per vehicle served by a RSU within a limited time window, we consider multi-band RSUs and ECUs as transmitting and receiving nodes, respectively. We consider legacy RF (radio frequency), mmWave (millimeter Wave), and visible light communication (VLC) bands at the RSU to provide large capacity links to the ECUs, respectively. However, the sub-channels of these frequency bands suffer from different blockage characteristics. We formulate this as a tradeoff problem in this paper in the presence of vehicular blockers, and propose a Thompson Sampling (TS)-based opportunistic band selection to alleviate the computational burden on both the communicating RSU and ECU nodes. Based on extensive computer-based simulations, we demonstrate the performance of our proposal in contrast with an optimal (centralized) baseline, as well as other comparable heuristic-based solutions.

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.001
metaresearch head score (Gemma)0.003
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.010
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.000
Bibliometrics0.0000.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.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.186
GPT teacher head0.459
Teacher spread0.273 · 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

Citations1
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Bandit Algorithms ResearchFrench-language works237,207