MétaCan
Menu
Back to cohort
Record W2168911585 · doi:10.1109/ntms.2008.ecp.14

A Simple and Efficient Detection of Wormhole Attacks

2008· article· en· W2168911585 on OpenAlex
Dang Quan Nguyen, Louise Lamont

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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsCommunications Research Centre Canada
Fundersnot available
KeywordsWormholeComputer scienceMobile ad hoc networkGlobal Positioning SystemSimple (philosophy)Computer networkRouting protocolSynchronization (alternating current)Optimized Link State Routing ProtocolNode (physics)Protocol (science)Routing (electronic design automation)Wireless ad hoc networkDistributed computingWirelessTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

Wormhole attacks in mobile ad hoc networks (MANET) have long been considered a serious threat to MANET's routing. Most of the existing proposals rely on GPS devices and require that the node's clocks are synchronized. Such constraints naturally lead to limitations of applicability since GPS does not operate well in obstructed areas, and clock synchronization in MANET is not always accurate. In this paper, we propose an efficient and simple way to detect wormhole attacks, using a technique called reference broadcast. GPS devices are not required, and clocks do not need to be synchronized. In fact, no particular assumption is made on the communication equipment. We show that our solution can be easily implemented, using either the well-known routing protocol OLSR or any neighbor discovery protocol. Our solution also exhibits a high degree of accuracy in detecting wormhole attacks.

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.861
Threshold uncertainty score0.174

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.012
GPT teacher head0.223
Teacher spread0.211 · 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

Quick stats

Citations26
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207