MétaCan
Menu
Back to cohort

Age of Information Minimization for Short-Packet Communications RSMA in Satellite-based IoT

2023· article· en· W4389544890 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 New Brunswick
Fundersnot available
KeywordsBlock Error RateComputer scienceTelecommunications linkNetwork packetRician fadingMinificationComputer networkBlock (permutation group theory)Mathematical optimizationFadingAlgorithmReal-time computingChannel (broadcasting)Mathematics

Abstract

fetched live from OpenAlex

This paper aims to minimize the age of information (AoI) of downlink rate-splitting multiple access (RSMA) in satellite-based Internet of Things (S-IoT) network over shadowed-Rician fading channels, where a satellite multicasts with multiple user equipments (UEs) by timely transmitting short-packet status updates. First, the expressions for block error rate (BLER) and average AoI (AAoI) are derived in a closed-form for short-packet communications with finite blocklength bound. Then, we formulate an AAoI minimization problem based on the theoretical derivations for the downlink RSMA S-IoT network, and design an age-optimal stationary power allocation (ASPA) scheme to solve the problem by utilizing the particle swarm optimization (PSO) algorithm. We further propose an age-optimal dynamic power allocation (ADPA) scheme based on the Markov decision process (MDP), and solve it by two deep reinforcement learning (DRL) algorithms. Monte Carlo simulations verify the accuracy of our derivations of BLER and AAoI, and also show that our ADPA scheme outperforms the related 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: Methods · Consensus signal: Methods
Teacher disagreement score0.428
Threshold uncertainty score0.351

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.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.038
GPT teacher head0.284
Teacher spread0.246 · 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

Citations4
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicAge of Information OptimizationFrench-language works237,207