MétaCan
Menu
Back to cohort
Record W2063103220 · doi:10.1109/wmnc.2014.6878879

An enhanced Gauss-Markov mobility model for simulations of unmanned aerial ad hoc networks

2014· article· en· W2063103220 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
KeywordsMobility modelComputer scienceWaypointMarkov chainRouting protocolNode (physics)Routing (electronic design automation)Markov processMarkov modelLimit (mathematics)Wireless ad hoc networkComputer networkSimulationDistributed computingReal-time computingMathematicsWirelessEngineeringTelecommunicationsMachine learning

Abstract

fetched live from OpenAlex

Routing protocols are designed assuming certain application-specific network characteristics. In order for a routing protocol to be effective and reliable it needs to be evaluated with a realistic mobility model. The Random Waypoint mobility model, widely used, allows node to stop suddenly and turn sharply, and therefore fails to capture the movement pattern of actual airborne vehicles. In this paper we propose the Enhanced Gauss-Markov (EGM) mobility model, a realistic model for networks of UAVs (UAANETs) based on the Gauss-Markov (GM) mobility model. EGM features mechanisms to eliminate/limit sudden stops and sharp turns within the simulation region. The model, unlike others, also deals explicitly with ensuring smooth trajectories at the boundaries. Simulations in OPNET show that EGM, compared to RWP, results in many more network partitions. This then suggests that network partitioning is a significant issue that ought to be dealt with in the protocol design for UAANETs.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.790
Threshold uncertainty score0.707

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.015
GPT teacher head0.269
Teacher spread0.255 · 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

Citations68
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207