MétaCan
Menu
Back to cohort
Record W2519684950 · doi:10.1109/wcnc.2016.7564966

Misbehaviour detection in vehicular networks using logistic trust

2016· article· en· W2519684950 on OpenAlexafffund
Saneeha Ahmed, Kemal Tepe

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsUniversity of Windsor
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceComputer securityEvent (particle physics)Computer networkQuality (philosophy)Data mining

Abstract

fetched live from OpenAlex

The quality of data and the performance of nodes in a dynamic network, such as vehicular networks (VANETs), is crucial for the applications running on the nodes of these networks. The data in such networks is vulnerable to various types of attacks, amongst which false information dissemination and on-off attacks offer the biggest threats to the applications. As the data depends on the events, it is necessary for any detection mechanism to determine the correct events before identifying the possible attacks. Therefore in this work, first the correct event is learned using information from the most trusted sources including the observations of the receiver itself. Later this information is used to identify the behaviour of the nodes by using the receiver's own observation which is complemented by the opinions of other nodes, in a logistic trust algorithm. It is observed that logistic trust results in a high accuracy of over 99% and a very low error of less than 2% even when the majority of the nodes are malicious.

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 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.401
Threshold uncertainty score0.582

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.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.018
GPT teacher head0.224
Teacher spread0.205 · 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 teacher head, 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

Citations28
Published2016
Admission routes2
Has abstractyes

Explore more

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