MétaCan
Menu
Back to cohort
Record W1564387379

A Markovian jump congestion control strategy for mobile ad-hoc networks with differentiated services traffic

2010· article· en· W1564387379 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

VenueChinese Control Conference · 2010
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer scienceComputer networkNetwork congestionMarkov processWireless ad hoc networkMobile ad hoc networkThroughputController (irrigation)Vehicular ad hoc networkNetwork packetPacket lossDistributed computingWirelessMathematics
DOInot available

Abstract

fetched live from OpenAlex

Available congestion control schemes such as the transport control protocol (TCP) when applied to wireless mobile networks will result in a large number of packet drop outs, unfair scenarios and low throughputs due to the changing number of neighboring nodes and the unpredictable network load. In this paper, a novel Markovian jump model is presented to model the changes in the number of neighboring nodes and subsequently a Markovian Jump Congestion Control (MJCC) strategy is proposed for mobile ad hoc networks. The MJCC strategy does take into account the associated physical network resource limitations and is shown to be robust to the existing unknown and time-varying network delays. Furthermore, the MJCC controller is developed on the basis of Differentiated Services (Diff-Serv) architecture by utilizing a robust adaptive technique. A Linear Matrix Inequality (LMI) condition is obtained to guarantee the stochastic stability of the closed-loop system. Simulations results and analysis illustrate the effectiveness and capabilities of our proposed MJCC strategy.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.878
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0020.000
Research integrity0.0000.001
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.006
GPT teacher head0.220
Teacher spread0.214 · 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