Maximizing IoT Throughput with Optimized IRS-Assisted Symbiotic Radio
Bibliographic record
Abstract
Symbiotic Radio (SR) is one of the techniques recognized by 6G for wireless communication networks performance enhancement.In this paper, SR is used to improve the performance of the Internet of Things (IoT) network by enabling IoT tags backscatter the neighbor smart phone primary signal rely on the None Orthogonal Multiple Access (NOMA) technique.Furthermore, Intelligent Reflecting Surfaces (IRS) are also proposed to enhance the channel Quality of Service (QoS); the service performance; between the IoT tags and the smartphones either using LTE or Wi-Fi network by smartly reconfiguring the signal propagation for performance improvement.We formulate an optimization problem to achieve the optimum location and phase shifts of the IRS, aiming to maximize the throughput of the IoT system.Proximal Policy Optimization (PPO) algorithm is introduced as a solution for this problem.The main idea of PPO is to minimize the divergence between the new and old policy while maximizing the expected reward.This is achieved by using a surrogate objective function that approximates the policy update.Simulation results demonstrate that the proposed algorithms can improve the total system data rate by an average of 40% above the system without using IRS and it also, improves the system capacity by 40% on average when compared to a system without the IRS scheme at smart phones 𝑝 =4 which serve tags 𝒯 =20.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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.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".