MétaCan
Menu
Back to cohort
Record W2094609215 · doi:10.1109/wcnc.2014.6952677

Routing in unmanned aerial ad hoc networks: A recovery strategy for Greedy geographic forwarding failure

2014· article· en· W2094609215 on OpenAlexaff
Jean-Daniel Medjo Me Biomo, Thomas Kunz, Marc St‐Hilaire

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer networkComputer scienceWireless ad hoc networkGeographic routingPacket forwardingMobile ad hoc networkNetwork packetRouting protocolNode (physics)Optimized Link State Routing ProtocolWireless Routing ProtocolWirelessEngineeringTelecommunications

Abstract

fetched live from OpenAlex

Unmanned Aeronautical Ad Hoc Networks (UAANETs) are a type of Mobile Ad Hoc Networks (MANETs) which are infrastructureless and self-organizing networks. The specificity of UAANETs is that they are formed by small and medium sized Unmanned Aerial Vehicles (UAVs) also known as drones. In UAANETs as well as in MANETs, geographic routing is widely used. Geographic routing relies on Greedy Forwarding (GF), also called Greedy Geographic Forwarding (GGF). GGF fails when a packet arrives at a node that has no neighbor closer to the destination than it is. The node in this situation is referred to as a void node. In this paper, we propose a strategy that salvages packets in void node situations. We thereafter append this strategy to a protocol that features GGF. Simulations in OPNET show an increase in packet delivery ratio of about 2% at virtually no additional cost.

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.001
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.001
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.000
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.013
GPT teacher head0.230
Teacher spread0.217 · 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

Citations49
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207