MétaCan
Menu
Back to cohort
Record W2254710028

A Backup Routing Scheme for Mobile Ad-Hoc Networks

2009· article· en· W2254710028 on OpenAlexaff
Amir Esmailpour, Nidal Nasser

Bibliographic record

VenueDOAJ (DOAJ: Directory of Open Access Journals) · 2009
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsComputer networkComputer scienceMobile ad hoc networkOptimized Link State Routing ProtocolWireless ad hoc networkAd hoc On-Demand Distance Vector RoutingDistributed computingDestination-Sequenced Distance Vector routingBackbone networkAd hoc wireless distribution serviceThroughputWireless Routing ProtocolRouting protocolLink-state routing protocolRouting (electronic design automation)WirelessNetwork packetTelecommunications
DOInot available

Abstract

fetched live from OpenAlex

In recent years, performance of the Mobile Ad-Hoc Network (MANET) has become an important research area in the wireless networks community. MANET consists of clusters of Mobile Nodes (MNs) on the access network that could be connected to other clusters through a fixed backbone of routers. The access link contention can severely constrain the end-to-end throughput of the path between a pair of source and destination MNs connected through the backbone. In this paper, we propose an integrated routing system for MANET that includes the backbone paths and the ad-hoc paths formed as a result of direct communication among MNs without going through the backbone. In our proposed routing system, an alternative ad-hoc path can be used only when the primary backbone path is severely constrained due to access links contention. We also propose a scheme for making the MN aware of link quality measures, and incorporate throughput metric in the core of AODV. We implemented the proposed routing system in the OPNET simulator, and evaluated the performance of our scheme under a variety of conditions. Simulation results show that the alternative ad-hoc path is effective in delivering higher throughput when the backbone path is severely constrained.

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.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: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.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.0020.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.157
GPT teacher head0.510
Teacher spread0.353 · 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
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueDOAJ (DOAJ: Directory of Open Access Journals)Same topicMobile Ad Hoc NetworksFrench-language works237,207