Deep Q-Learning-Based Resource Management in IRS-Assisted VLC Systems
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.
Bibliographic record
Abstract
Visible Light Communication (VLC) is a promising enabling technology for the next-generation wireless networks, as it complements radio-frequency (RF)-based communications by providing wider bandwidth, higher data rates, and immunity to interference from electromagnetic sources. However, due to its unique characteristics, VLC is highly sensitive to the line-of-sight (LoS) blockage. Recently, intelligent reflecting surface (IRS) has been proposed as an innovative solution that dynamically reconfigures the wireless environment. The present contribution proposes a two-stage resource management framework in an indoor VLC system: In the first stage, a maximum possible fairness (MPF) algorithm is presented in order to maximize the fairness amongst the users. In the second stage, deep Q-learning is exploited in order to maximize the overall spectral efficiency (SE). The corresponding numerical results have shown that the proposed DQL-MPF framework exhibits superior performance in terms of both the overall SE and Jain’s Fair Index, achieved at a fast convergence rate. More specifically, when the noise power is high and the number of users is relatively large, the DQL-MPF algorithm achieves a more than tenfold overall SE compared to the Baseline scheme. Moreover, the synergy between the MPF and the DQL algorithms is investigated. To this end, we demonstrate that the MPF algorithm maximizes the fairness amongst the users while the DQL algorithm maximizes the overall SE and improves the robustness against the noise. Our results also highlight the effectiveness of the proposed algorithm in leveraging the increasing number of IRS elements for optimized performance.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.002 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it