MétaCan
Menu
Back to cohort
Record W2031628231 · doi:10.1145/1868497.1868499

Adaptive routing in mobile ad hoc networks based on decision aid approach

2010· article· en· W2031628231 on OpenAlexaff
Yağız Onat Yazır, Roozbeh Farahbod, Adel Guitouni, Sudhakar Ganti, Yvonne Coady

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsComputer scienceMobile ad hoc networkRouting (electronic design automation)Adaptation (eye)LimitingDestination-Sequenced Distance Vector routingWireless ad hoc networkVotingAdaptive quality of service multi-hop routingDistributed computingOptimized Link State Routing ProtocolWork (physics)Scale (ratio)Routing protocolProcess (computing)Computer networkLink-state routing protocolWirelessEngineering

Abstract

fetched live from OpenAlex

In this paper, we propose a new approach to the problem of adaptive routing in small scale Mobile Ad Hoc Networks (MANET). The proposed approach focuses on leveraging the already existing routing algorithms in real-time through switching from one routing algorithm to another as the conditions change. The contribution of this work is three-fold: (1) nodes use a Multiple Criteria Decision Analysis method called PROMETHEE to make local decisions, (2) the final decision is evaluated as an aggregation of all the local decisions in the MANET through weighted voting, and (3) the network-wide decision process is carried out through a hybrid method that aims to benefit from the advantages of centralized and distributed methods, while limiting their disadvantages. The analyses based on the results extracted from simulations underline that the proposed approach produces stable configurations with minimal interruptions. Furthermore, the completion of global adaptation cycles are performed an order of magnitude faster in comparison to the results outlined in the previous work. These results indicate that the proposed solution is a promising alternative to the existing solutions, and forms a strong basis for further research on larger scale MANETs.

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.001
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: Methods · Consensus signal: none
Teacher disagreement score0.705
Threshold uncertainty score0.814

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0010.000
Research integrity0.0000.001
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.232
Teacher spread0.221 · 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 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

Citations7
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207