MétaCan
Menu
Back to cohort
Record W2063478416 · doi:10.1155/2014/319514

Cooperative Downloading by Multivehicles in Urban VANET

2014· article· en· W2063478416 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.

Bibliographic record

VenueInternational Journal of Distributed Sensor Networks · 2014
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsSimon Fraser University
FundersNational Natural Science Foundation of ChinaSalt Science Research Foundation
KeywordsComputer scienceVehicular ad hoc networkComputer networkUploadWireless ad hoc networkSoftware deploymentThe InternetWirelessTelecommunicationsOperating system

Abstract

fetched live from OpenAlex

In VANET (vehicular ad hoc network), RSUs (road side units) have limited coverage and high deployment cost, so they are deployed sparsely in urban area, which leads to blind zone (BZ) between adjacent RSUs, where vehicles cannot connect to Internet by RSUs. In this paper, we study how to use RSUs and vehicles to download big files cooperatively in BZ. In order to choose the cooperative vehicles with minimum total delay, we propose a sequential decision vehicle selection method based on the residual file (SSRF). The method divides the process of selection into several stages and selects cooperative vehicles from the candidates; the decision sequence generated by SSRF determines the set of cooperative vehicles. Simulation and data analysis show that our method is effective in terms of delivered ratio and file delivered delay.

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 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: Empirical
Teacher disagreement score0.333
Threshold uncertainty score0.917

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.0000.000
Research integrity0.0000.001
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.004
GPT teacher head0.205
Teacher spread0.201 · 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