MétaCan
Menu
Back to cohort

Age and Energy Analysis in Code-Based Status Update System over Fading Channels

2023· article· en· W4387870168 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
TopicAge of Information Optimization
Canadian institutionsUniversity of Windsor
FundersNational Natural Science Foundation of China
KeywordsHybrid automatic repeat requestFadingComputer scienceTransmission (telecommunications)Redundancy (engineering)Block (permutation group theory)Energy (signal processing)Code (set theory)Real-time computingEfficient energy useAlgorithmDecoding methodsTelecommunicationsStatisticsMathematicsEngineering

Abstract

fetched live from OpenAlex

Energy efficiency and information freshness are two fundamentally critical performance metrics in real-time status update systems which can be measured by energy cost (EC) and age of information (AoI), respectively. This paper examines the AoI and EC performance of the hybrid automatic repeat request with incremental redundancy (HARQ-IR) scheme in code-based status update systems and presents unified results that can generally depict the average AoI and EC over block fading channels. First, we propose a practical code-based status update system that fully takes into account the impact of information processing and long-distance transmission in performance analysis. Then, we analyze and derive the average AoI/EC expressions for HARQ-IR scheme, which are unified results over block fading channels. The simulations of different transmission protocols validate our explicit results and show that there is a distance threshold on whether to retransmit the failed updates. Based on the simulation results, it appears that system AoI/EC demand will affect distance threshold values, which provide guidance for future designs of age-energy tradeoff transmission schemes.

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: Empirical · Consensus signal: none
Teacher disagreement score0.973
Threshold uncertainty score0.270

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.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.011
GPT teacher head0.224
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

Quick stats

Citations1
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicAge of Information OptimizationFrench-language works237,207