Active STAR-RIS-Aided Wireless Powered Communication Networks
Bibliographic record
Abstract
In this paper, we investigate a wireless powered communication network (WPCN) in which a multi-antenna hybrid access point (HAP) communicates with multiple Internet-of-Things (IoT) devices, assisted by an active simultaneously transmitting and reflecting reconfigurable intelligent surface (aSTAR-RIS). In the energy transfer (ET) phase, the IoT devices harvest energy from the HAP with a nonlinear energy harvesting (EH) model, and subsequently transmit information signals to the HAP during the information transmission (IT) phase. To explore its full potential, the aSTAR-RIS employs energy splitting (ES), mode switching (MS), and time switching (TS) protocols. A sum rate maximization problem is formulated for each protocol, which jointly optimize the beamforming at the HAP, allocation of time slots and transmitting power for the IoT devices, and the adaptation of the aSTAR-RIS coefficients. To address the optimization problem with multiple coupled variables and complex non-convex constraints, we firstly decompose it into several subproblems. Specifically, to optimize the coefficients of the aSTAR-RIS in the IT phase, we develop a fractional programming-based successive convex approximation algorithm to handle the fractional objective function and the minimum rate constraints. Moreover, to obtain the coefficients of the aSTAR-RIS during the ET phase, we design a penalty-based SCA algorithm to address the binary constraints in the MS protocol and the rank-one constraints. Numerical results demonstrate that 1) employing the aSTAR-RIS in WPCNs can realize the extraordinary sum rate gain in comparison with the benchmarks of the active RIS and the passive STAR-RIS; 2) among the three operation protocols, the ES demonstrates the best performance, with the MS following closely behind, while the TS is the least effective; 3) as the minimum required data rate for each IoT device decreases, the performance gap among the three protocols becomes narrower.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| 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".