MétaCan
Menu
Back to cohort

Risk-based Trust Evaluation Model for VANETs

2020· article· en· W3116706838 on OpenAlexaff
Rasha Jamal Atwa, Paola Flocchini, Amiya Nayak

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceAction (physics)Process (computing)Component (thermodynamics)Flexibility (engineering)Wireless ad hoc networkScheme (mathematics)Risk analysis (engineering)Vehicular ad hoc networkDecision-makingComputer securityWirelessBusinessTelecommunications

Abstract

fetched live from OpenAlex

Vehicular ad hoc networks (VANETs) have drawn a lot of attention in recent years due to their potential in improving traffic safety applications. Evaluating trust between peers in such networks is an essential component that determines whether a received report from a neighboring vehicle should be accepted or refused. For this purpose, many VANET trust management models have been proposed, differing in their architecture, trust establishment process, and flexibility. However, risk estimation has not been taken into consideration in all of these models. In this paper, we propose a risk-based trust evaluation model that overcomes the information oversampling issue in VANETs. The proposed model provides a decision-making process for vehicles receiving conflicting reports regarding an event's occurrence according to the risk estimation for each required action of both reports. The risk is estimated according to the likelihood of taking an incorrect action and its associated impact. Finally, a decision is made corresponding to the action with the lowest risk. We show that a risk-based decision-making scheme may take different actions than a purely trust-based method. Simulation results show that the risk-based trust model outperforms a purely trust-based model.

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.005
metaresearch head score (Gemma)0.015
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.025

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.015
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.004
Open science0.0020.002
Research integrity0.0020.002
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.032
GPT teacher head0.241
Teacher spread0.209 · 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

Citations6
Published2020
Admission routes1
Has abstractyes

Explore more

Same topicVehicular Ad Hoc Networks (VANETs)French-language works237,207