MétaCan
Menu
Back to cohort
Record W4405933769 · doi:10.1109/ojvt.2024.3523247

Beyond Single-User Scheduling: Exploiting Massive MIMO for Concurrent Data Delivery With Minimum Age of Information

2024· article· en· W4405933769 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Open Journal of Vehicular Technology · 2024
Typearticle
Languageen
FieldComputer Science
TopicAge of Information Optimization
Canadian institutionsUniversity of the Fraser Valley
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceScheduling (production processes)Distributed computingMathematicsMathematical optimization

Abstract

fetched live from OpenAlex

With the emergence of real-time applications, modern wireless networks have witnessed the use of Age of Information (AoI) as a critical metric for evaluating the timeliness of data delivery. This paper considers multi-user scheduling, extending beyond traditional single-user scheduling, to exploit the potential of Massive Multiple-Input Multiple-Output (mMIMO) systems for concurrent data delivery over imperfectly known channel state information (CSI). We propose a novel transmission scheduling framework that leverages the spatial multiplexing capabilities of mMIMO to minimize the AoI across multiple users. This results in a joint optimization of multi-user scheduling and power allocation problem for optimum data freshness in a wireless broadcast network. We handle the non-convexity of the resulting problem by utilizing successive convex approximation to specifically reformulate the binary/integer and non-convex constraints of the problem. Extensive simulations demonstrate superior performance of the proposed framework and its solution in terms of AoI compared to existing benchmarks.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.683
Threshold uncertainty score0.523

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.007
Open science0.0030.001
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.034
GPT teacher head0.279
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