MétaCan
Menu
Back to cohort
Record W4240183566 · doi:10.32920/ryerson.14655516

An Energy Aware Trust Based Multipath Routing Scheme For Mobile Ad Hoc Networks

2021· preprint· en· W4240183566 on OpenAlexaff
Michael Ryan Sahai

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceComputer networkDynamic Source RoutingWireless Routing ProtocolDestination-Sequenced Distance Vector routingMultipath routingLink-state routing protocolRouting protocolDistributed computingOptimized Link State Routing ProtocolStatic routingRouting (electronic design automation)

Abstract

fetched live from OpenAlex

Message security in multi-hop infrastructure-less networks such as Mobile Ad Hoc Net- works has proven to be a challenging task. A number of trust-based secure routing protocols has recently been introduced comprising of the traditional route discovery phase and a data transmission phase. In the latter, the action of relaying the data from one mobile node to another relies on the peculiarity of the wireless transmission medium as well as the capability of the source nodes to keep their energy level at an acceptable and reasonable level, posing another concern which is that of energy efficiency. This thesis proposes an Energy-Aware Trust Based Multi-path secured routing scheme (E-TBM) for MANETs, based on the dynamic source routing protocol (DSR). Results show that the E-TBM scheme outperforms the Trust Based Multi-path (TBM) secured routing scheme [1], chosen as a benchmark, in terms of energy consumption of the selected routing paths, number of dead nodes, trust compromise and route selection time, chosen as performance metrics.

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.000
metaresearch head score (Gemma)0.002
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.001
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0010.001
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.017
GPT teacher head0.264
Teacher spread0.246 · 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
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
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207