Age of Information Optimization in RIS-Assisted Wireless Networks
Bibliographic record
Abstract
In this paper, we consider a wireless network consisting of a base station that is serving multiple real-time traffic streams forwarding information updates to their destinations in order to sustain the freshness of information for time-critical applications. Since the wireless channels may be unreliable due to the impurities of the propagation environments, such as deep fading, blockages, etc., we integrate a reconfigurable intelligent surface to the wireless system in order to mitigate the propagation-induced impairments, enhance the quality of the wireless links, and ensure that the required freshness of information is achieved for these real time applications. For this network set-up, we investigate the joint optimization of the traffic streams scheduling and the reconfigurable intelligent surface phase-shift matrix with the goal of minimizing the long-term average Age of Information. The formulated optimization problem is a mixed integer non-convex optimization problem, which is difficult to solve. To circumvent the high-coupled optimization variables, and with the aid of bi-level optimization, we decompose the original problem into an outer traffic stream scheduling problem and an inner reconfigurable intelligent surface phase-shift matrix problem. For the outer problem, owing to its complexity and stochastic nature of packet arrivals, we resort to deep reinforcement learning solution where the traffic stream scheduling is modeled as a Markov Decision Process, and Proximal Policy Optimization is invoked to solve it. Whereas, the inner problem that determines the reconfigurable intelligent surface configuration is solved through semi-definite relaxation. Finally, we show through extensive simulations that our approach evaluates the combined impact of scheduling policy and reconfigurable intelligent surface configuration on the long term average Age of Information, where we demonstrate its superiority against other 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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".