MétaCan
Menu
Back to cohort
Record W4386025741 · doi:10.1109/tnsm.2023.3306179

Optimizing Age of Information in RIS-Empowered Uplink Cooperative NOMA Networks

2023· article· en· W4386025741 on OpenAlexaff
Ali Muhammad, Mohamed Elhattab, Mohamed Amine Arfaoui, Chadi Assi

Bibliographic record

VenueIEEE Transactions on Network and Service Management · 2023
Typearticle
Languageen
FieldComputer Science
TopicAge of Information Optimization
Canadian institutionsConcordia University
Fundersnot available
KeywordsTelecommunications linkNomaComputer scienceBase stationConvex optimizationOptimization problemTransmitter power outputReduction (mathematics)Power (physics)Channel (broadcasting)Mathematical optimizationPower controlRegular polygonComputer networkMathematicsAlgorithmTransmitterPhysics

Abstract

fetched live from OpenAlex

This paper investigates the potential of integrating reconfigurable intelligent surface (RIS) and cooperative non-orthogonal multiple access (C-NOMA) in preserving the freshness of information in real-time Internet of Things (IoT) applications. The system model comprises one base stations (BS), one RIS, and two IoT devices (IoTDs), in an uplink setting, where the IoTD with poor channel quality is assisted by the RIS and by the IoTD with the strong quality through a full duplex (FD) device-to-device (D2D) communication. In this setup, an optimization problem has been formulated to minimize the average sum Age of Information (AoI) by optimizing the transmit power of the IoTDs and the RIS phase shift matrix, which is non-convex and is hard to solve directly. In order to resolve this issue, the formulated optimization problem is divided into a power control sub-problem and a RIS configuration sub-problem. Capitalizing on that, a closed-form solution has been derived for the power control sub-problem and the RIS configuration sub-problem is solved by resorting to difference-of-convex (DC) along with successive convex approximation (SCA). The simulation results demonstrate that the proposed RIS-empowered uplink C-NOMA scheme achieves higher AoI-reduction compared to all considered baseline 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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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.002
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.010
GPT teacher head0.216
Teacher spread0.206 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations26
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Network and Service ManagementSame topicAge of Information OptimizationFrench-language works237,207