A Joint Optimization Framework for IRS-Assisted Energy Self-Sustainable IoT Networks
Bibliographic record
Abstract
Energy self-sustainability is critically important for future Internet of Things (IoT) networks to support an ever-growing massive number of wireless devices with low maintenance cost and high spectrum/energy efficiency. Power-splitting (PS)-based simultaneous wireless information and power transfer (PS-SWIPT) is a promising solution to realize it. However, the performance of PS-SWIPT is severely influenced by the channel attenuation caused by the detrimental radio propagation environment. Intelligent reflecting surface (IRS) is an emerging technology that can reconfigure the incident signal with considerable array gain so as to improve the PS-SWIPT performance. Thus, in this article, we investigate the weighted sumrate (WSR) maximization problem of the IRS-assisted multi-input–multioutput (MIMO) PS-SWIPT IoT network with multiple low-power IoT PS-based devices (PSDs). The formulated problem is nonconvex and arduous to tackle due to the presence of the intricately coupled variables and the mutually exclusive constraints. To the best of our knowledge, the problem is not addressed yet and cannot be solved by employing the existing methods directly. To cope with the problem, we develop a joint optimization framework that decomposes the original problem into several subproblems that can be solved alternately. Simulation results confirm the effectiveness of IRS to improve the WSR of the PS-SWIPT energy self-sustainable IoT networks and demonstrate that the proposed algorithm outperforms benchmark methods considerably.
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.001 |
| 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.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".