MétaCan
Menu
Back to cohort
Record W2117244388 · doi:10.1109/icc.2005.1495076

An adaptive scheduling algorithm for bluetooth ad-hoc networks

2005· article· en· W2117244388 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
TopicBluetooth and Wireless Communication Technologies
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer sciencePiconetBluetoothComputer networkScheduling (production processes)Wireless ad hoc networkScatternetMaximum throughput schedulingDistributed computingDynamic priority schedulingAlgorithmWirelessRound-robin schedulingMathematical optimizationQuality of serviceMathematics

Abstract

fetched live from OpenAlex

In this paper, we propose an adaptive scheduling algorithm (ASA) for Bluetooth scatternets. ASA is adaptive in that the bandwidth allocated on each link or session is dynamically adjusted based on the estimated traffic. ASA integrates both intra-piconet and inter-piconet scheduling to improve the aggregate throughput and delay. ASA prevents the bridge node conflict and satisfies the max-min fairness criterion. We compare our proposed ASA with two other scheduling algorithms via simulations. Results show that ASA provides good performance in terms of fairness, aggregate throughput, and average delay.

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.000
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.968
Threshold uncertainty score0.525

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.0020.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.023
GPT teacher head0.268
Teacher spread0.245 · 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