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 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
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.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
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.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

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

Citations68
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207