MétaCan
Menu
Back to cohort
Record W4399417715 · doi:10.1109/lwc.2024.3410173

Hybrid <i>k</i>-Preemptive Transmission Scheme for Minimal Age of Information in IoT Networks

2024· article· en· W4399417715 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

VenueIEEE Wireless Communications Letters · 2024
Typearticle
Languageen
FieldComputer Science
TopicAge of Information Optimization
Canadian institutionsQueen's UniversityUniversity of Windsor
Fundersnot available
KeywordsComputer scienceScheme (mathematics)Computer networkTransmission (telecommunications)Information transmissionInternet of ThingsMathematicsTelecommunicationsEmbedded system

Abstract

fetched live from OpenAlex

This letter explores the Age of Information (AoI) in IoT networks, aiming to minimize the average AoI for real-time applications. We employ a spatiotemporal model with a heterogeneous Poisson field (HPF) of interferers and an absorbing Markov chain (AMC) to quantify AoI dynamics. This model specifically examines the effects of packet segmentation (i.e., rate adaptation) to maintain a stable rate in the presence of IoT interference. Unlike previous works focused on preemptive and non-preemptive schemes, we propose a novel hybrid k-preemptive transmission scheme. This scheme dynamically decides whether to continue or preempt transmission based on the number of delivered segments, addressing interference issues. Simulation results demonstrate the superiority of the proposed scheme over conventional schemes, consistently minimizing the average AoI.

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

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.002
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.016
GPT teacher head0.252
Teacher spread0.236 · 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