MétaCan
Menu
Back to cohort
Record W2365850636

Securing Ad Hoc Networks

2005· article· en· W2365850636 on OpenAlexvenueno aff
XU Bang-hai

Bibliographic record

VenueMicrocomputer applications · 2005
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceWireless ad hoc networkMobile ad hoc networkComputer networkWireless networkVehicular ad hoc networkDelay-tolerant networkingAd hoc wireless distribution serviceRedundancy (engineering)Vulnerability (computing)Adaptive quality of service multi-hop routingComputer securityWirelessOptimized Link State Routing ProtocolDistributed computingTelecommunicationsNetwork packet
DOInot available

Abstract

fetched live from OpenAlex

Ad Hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, they do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. One main challenge in design of these networks is their vulnerability to security goals to be achieved. We i dentify the new challenges and opportunities posed by this new networking environment and explore new approaches tosecure its communication. In particular, we take advantage of the inherent redundancy in ad hoc networks-multipleroutes between nodes-to defend 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.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.955
Threshold uncertainty score0.867

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.001

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.006
GPT teacher head0.220
Teacher spread0.214 · 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 designOther design
Domainnot available
GenreMethods

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

Citations0
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueMicrocomputer applicationsSame topicMobile Ad Hoc NetworksFrench-language works237,207