MétaCan
Menu
Back to cohort
Record W3212714379 · doi:10.32920/ryerson.14654013.v1

Preventing Collaborative Blackhole Attacks on Mobile Ad Hoc Networks

2021· preprint· en· W3212714379 on OpenAlexaff
Rajender Dheeraj Peddi

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsPacket drop attackComputer networkNetwork packetComputer scienceNode (physics)Routing protocolOverhead (engineering)Benchmark (surveying)Routing (electronic design automation)DSRFLOWThroughputDynamic Source RoutingEnd-to-end delayProtocol (science)Mobile ad hoc networkWireless ad hoc networkLink-state routing protocolEngineeringWirelessTelecommunicationsMedicine

Abstract

fetched live from OpenAlex

This thesis proposes two protocols for addressing collaborative blackhole attacks in MANETs, referred to as the Detecting Blackhole Attack-Dynamic Source Routing(DBA-DSR) and Detecting Collaborative Blackhole Attack (DCBA) algorithms. The DBA-DSR protocol uses fake Route request packets to attract the malicious nodes before the actual routing process. The DCBA protocol uses our so-called suspicious value, which is based on the abnormal difference between the routing messages transmitted through a node, to identify the malicious nodes. In later stage, if the destination node detects significant loss in data packets, the initial detecting mechanism will be triggered again to identify malicious nodes. Simulation results are provided, showing significant improvement over the DSR protocol, as well as the Baited blackhole DSR protocol(chosen as a benchmark scheme), in terms of performance metrics such as packet delivery ratio, network throughput, average-end-to-end delay and routing overhead.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation 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: none
Teacher disagreement score0.001
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.000
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.013
GPT teacher head0.268
Teacher spread0.255 · 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 source (direct Gemma or distilled Codex), 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

Citations0
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207