MétaCan
Menu
Back to cohort
Record W2085333208 · doi:10.4304/jnw.4.1.9-18

Probabilistic Evidence Aggregation for Malicious Node Position Bounding in Wireless Networks

2009· article· en· W2085333208 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

VenueJournal of Networks · 2009
Typearticle
Languageen
FieldComputer Science
TopicSecurity in Wireless Sensor Networks
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer scienceBounding overwatchProbabilistic logicNode (physics)Computer networkPosition (finance)WirelessWireless networkComputer securityArtificial intelligenceTelecommunications

Abstract

fetched live from OpenAlex

Abstract — Hyperbolic position bounding of malicious devices aims to estimate the location of a wireless network rogue insider that transmits an attack message containing falsified information to mislead honest nodes. A probabilistic path loss model is used to construct an area in Euclidian space bounded by minimum and maximum distance difference hyperbolas between each pair of trusted receivers. This hyperbolic area is said to contain the rogue insider with a degree of confidence. We explore the combination of evidence provided by a set of multiple receiver pairs supporting the intersection of their hyperbolic space. We propose a novel heuristic scheme to aggregate area probability so that the combined degree of confidence ascribed to the intersecting space is computed according to a paradigm of supportive rather than competitive evidence. Performance evaluation concludes that our aggregation model yields a probability distribution better fitted to experimental location estimation results than a redistributive paradigm.

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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.857
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.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.023
GPT teacher head0.278
Teacher spread0.256 · 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