NOMA-Based Ze-RIS Empowered Backscatter Communication With Energy-Efficient Resource Management
Bibliographic record
Abstract
This manuscript introduces a novel energy-efficient optimization strategy for a zero-energy reconfigurable intelligent reflecting surface (Ze-RIS) supported backscatter communication system employing non-orthogonal multiple access (NOMA). The central objective is to maximize the energy-efficiency of the system by optimizing the several key parameters, including the amplitude reflection coefficient of Ze-RIS, the reflection coefficients of the backscatter tags, transmit beamforming at the base station, and passive beamforming at the Ze-RIS node, while incorporating a practical non-linear energy harvesting model both for the Ze-RIS and backscatter nodes. The proposed algorithm addresses the complex non-convex problem through three stages. Firstly, the transmit beamforming vectors are determined by leveraging the semi-definite programming and successive-convex approximation, while handling the rank-1 constraint with the semi-definite relaxation. Secondly, we determine the amplitude reflection coefficient of Ze-RIS by leveraging the monotonicity property of the objective function. Simultaneously, we compute the reflection coefficients of backscatter tags using the Dinkelbach algorithm, Lagrange duality, and the sub-gradient method. Thirdly, we compute passive beamforming using successive-convex approximation and semi-definite programming techniques, achieving a rank-1 solution through the penalty-based method. Finally, the numerical simulations confirm the effectiveness of the proposed approach, demonstrating its superiority over the benchmark competitors with rapid convergence within a few iterations.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".