MétaCan
Menu
Back to cohort
Record W2183275409

A Survey on Geographic Routing Protocols for Mobile Ad hoc Networks

2011· article· en· W2183275409 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer scienceMobile ad hoc networkWireless ad hoc networkComputer networkTelecommunicationsWireless
DOInot available

Abstract

fetched live from OpenAlex

Geographic routing has become one of the most suitable routing strategies in wireless mobile ad hoc network mainly due to its scalability. That is because there is no need to maintain explicit routes. The principle approach in geographic routing is greedy forwarding, which fails if the packet encounters a void node (i.e., a node with no neighbour closer to the destination than itself). Face routing and its variations have been proposed and widely studied in the literature as recovery strategies to handle voids. However, face routing strategies are based on two primitives, planarization and face traversal, which make them unsuitable in 3D networks. This survey presents an overview of different face routing algorithms as well as alternatives to face routing strategies. The majority of the proposed face routing strategies and void handling techniques are designed with some idealized assumptions, which are not usually true in realistic scenarios and special types of networks such as sparse networks. We will discuss some of the shortcomings and possible directions for future research from an unmanned aeronautical ad hoc networks’

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.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.897
Threshold uncertainty score0.798

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.000
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.051
GPT teacher head0.284
Teacher spread0.233 · 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

Quick stats

Citations43
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207