Integration of Backscatter Communication with Multi-cell NOMA: A Spectral Efficiency Optimization under Imperfect SIC
Bibliographic record
Abstract
Future wireless networks are expected to connect large-scale low-powered communication devices using the available spectrum resources. Backscatter communications (BC) is an emerging technology towards battery-free transmission in future wireless networks by leveraging ambient radio frequency (RF) waves that enable communications among wireless devices. Non-orthogonal multiple access (NOMA) has recently drawn significant attention due to its high spectral efficiency. The combination of these two technologies can play an important role in the development of future networks. This paper proposes a new optimization approach to enhance the spectral efficiency of nonorthogonal multiple access (NOMA)-BC network. Our framework simultaneously optimizes the power allocation of base station and reflection coefficient (RC) of the backscatter device in each cell under the assumption of imperfect signal decoding. The problem of spectral efficiency maximization is coupled on power and RC which is challenging to solve. To make this problem tractable, we first decouple it into two subproblems and then apply the decomposition method and Karush-Kuhn-Tucker conditions to obtain the efficient solution. Numerical results show the performance of the proposed NOMA-BC network over the pure NOMA network without BC.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| 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.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".