Dynamic Scheduling for Enhanced Performance in RIS-assisted Cooperative Network with Interference
Bibliographic record
Abstract
Reconfigurable Intelligent Surfaces (RIS) have emerged as transformative technologies, enhancing spectral efficiency and improving interference management in multi-user cooperative communications. This paper investigates the integration of RIS with Flexible-Duplex (FlexD) communication, featuring dynamic scheduling capabilities, to mitigate unintended external interference in multi-user wireless networks. By leveraging the reconfigurability of RIS and dynamic scheduling, we propose a user-pair selection scheme to maximize system throughput when full channel state information (CSI) of interference is unavailable. We develop a mathematical framework to evaluate the throughput outage probability when RIS introduces spatial correlation. The derived analytical results are used for asymptotic analysis, providing insights into dynamic user scheduling under interference based on statistical channel knowledge. Finally, we compare FlexD with traditional Full Duplex (FD) and Half Duplex (HD) systems against RIS-assisted FlexD. Our results show FlexD’s superior throughput enhancement, energy efficiency and data management capability in interference-affected networks, typical in current and next-generation cooperative wireless applications like cellular and vehicular communications.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".