MétaCan
Menu
Back to cohort
Record W2129802095 · doi:10.1002/wcm.935

A secure and efficient RSU‐aided bundle forwarding protocol for vehicular delay tolerant networks

2010· article· en· W2129802095 on OpenAlex
Xiaodong Lin, Hsiao‐Hwa Chen

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

VenueWireless Communications and Mobile Computing · 2010
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsOntario Tech University
Fundersnot available
KeywordsComputer scienceComputer networkVehicular ad hoc networkWireless ad hoc networkProtocol (science)BundleVehicle-to-vehicleDelay-tolerant networkingWirelessTelecommunications

Abstract

fetched live from OpenAlex

Abstract Recently, vehicular ad hoc network (VANET) has emerged as a promising approach for road safety and traffic efficiency improvement through a variety of vehicle applications enabled by communications between vehicles such as emergency braking warning, etc. However, due to its unique characteristics, such as intermittent connectivity due to high‐speed mobility of the network nodes (or vehicles), also known as vehicular delay tolerant network, it poses a major challenge to the realization of those applications. In this paper, we propose a new roadside unit (RSU) aided bundle forwarding protocol for vehicular delay tolerant networks. Furthermore, with the assistance from those RSUs deployed at some critical points on the road, for example, intersections, the proposed protocol can increase the network performance in terms of delivery ratio. At the same time, since vehicle‐to‐vehicle (V2V) and vehicle‐to‐RSU (V2R) privacy‐preserving authentications are guaranteed, the black (gray) hole attacks can be avoided. Extensive simulations demonstrate the effectiveness of the proposed protocol. Copyright © 2010 John Wiley & Sons, Ltd.

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.001
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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.959
Threshold uncertainty score0.920

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.001
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.020
GPT teacher head0.295
Teacher spread0.275 · 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