Robust Transmission Design in Multiobjective RIS-Aided SWIPT IoT Communications
Bibliographic record
Abstract
This work investigates the performance of simultaneous wireless information and power transfer (SWIPT) in a reconfigurable intelligent surface (RIS)-aided internet of things (IoT) communications under imperfect channel state information (CSI). We formulate a multi-objective optimization problem (MOOP) to design transmit precoding vector (TPV) at the base station (BS) and phase shift matrix (PSM) at the RIS that jointly maximizes energy efficiency (EE) and harvested power (HP) under the norm bounded CSI error model. Due to the conflicting objective functions and non-convex nature of the above optimization problem, the MOOP is simplified using the.-constraint method and subsequently adopting advanced optimization tools, such as Dinkelbach method, S-procedure, general sign-definiteness, semidefinite programming and convex-concave procedure. Thereafter, we propose an alternating optimization-based algorithm which determines optimal TPV and PSM iteratively that jointly maximizes the EE and HP of the considered system. Through numerical simulations, we validate the robustness, optimality, convergence, accuracy and effectiveness of our proposed algorithm. Furthermore, we assess the impact of several key parameters such as the number of RIS elements, available transmit power at BS and the minimum HP on the performance of the considered system.
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.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".