MétaCan
Menu
Back to cohort
Record W2140826297 · doi:10.1109/wocn.2005.1436049

Using mobile agents for intrusion detection in wireless ad hoc networks

2005· article· en· W2140826297 on OpenAlex
Abbas Hijazi, Nidal Nasser

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 institutionsUniversity of GuelphQueen's University
Fundersnot available
KeywordsIntrusion detection systemComputer scienceWireless ad hoc networkMobile ad hoc networkVehicular ad hoc networkWirelessAd hoc wireless distribution serviceComputer securityComputer networkMobile computingWireless networkMobile agentIntrusion prevention systemOptimized Link State Routing ProtocolTelecommunications

Abstract

fetched live from OpenAlex

Many attempts were made to secure wireless ad hoc networks (WAHNs), but due to their special ad hoc nature and strict constraints, finding an optimal and comprehensive security solution is still a research challenge. In this paper we present the main security challenges of WAHNs. Then we study and analyze mobile agents and their attributes against those challenging requirements. The analyses show a great feasibility and promising suitability for mobile-agent-based solutions to be adopted by the WAHNs intrusion detection systems. The paper also surveys, studies and compares the existing WAHNs mobile-agents-based intrusion detection designs.

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.813
Threshold uncertainty score0.541

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.001
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.024
GPT teacher head0.276
Teacher spread0.252 · 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

Citations29
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207