MétaCan
Menu
Back to cohort
Record W88094450

Achieving Load Awareness in Position-based Wireless Ad Hoc Routing

2012· preprint· en· W88094450 on OpenAlexaff
Xu Li, Nathalie Mitton, Ivan Stojmenović, Amiya Nayak

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsWilfrid Laurier UniversityUniversity of Ottawa
Fundersnot available
KeywordsWireless ad hoc networkComputer networkComputer scienceAd hoc wireless distribution serviceWirelessMobile ad hoc networkOptimized Link State Routing ProtocolTelecommunications
DOInot available

Abstract

fetched live from OpenAlex

Abstract—We propose applying the concept of Cost-to-Progress Ratio (CPR) in position-based greedy routing for load reduction and balancing. The load of a node is the percentage of time it is occupied by forwarding traffic or the inability to forward due to interference. The resultant routing protocol, named CPR-routing, is a localised parameter-less approach, optimising the ratio of nodal load and geographic progress. Through extensive simulation, we evaluate it in comparison with an existing parameter-based localised solution, a-routing. Our simulation results indicate that CPR-routing outperforms a-routing in per node load, success rate, and average hop count. Keywords-load awareness; geographic routing; cost-to-progress ratio; wireless ad hoc networks I.

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.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.001
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.003
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.020
GPT teacher head0.263
Teacher spread0.243 · 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 designTheoretical or conceptual
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

Citations16
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207