MétaCan
Menu
Back to cohort
Record W4391697091 · doi:10.1109/jiot.2024.3364392

Robust Transmission Design in Multiobjective RIS-Aided SWIPT IoT Communications

2024· article· en· W4391697091 on OpenAlex
Vaibhav Sharma, Raviteja Allu, Sandeep Kumar Singh, Keshav Singh, Trung Q. Duong, Theodoros A. Tsiftsis

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Internet of Things Journal · 2024
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Technologies
Canadian institutionsMemorial University of Newfoundland
FundersNational Natural Science Foundation of ChinaNational Science and Technology Council
KeywordsComputer scienceMathematical optimizationTransmitter power outputChannel state informationOptimization problemSemidefinite programmingPrecodingRobustness (evolution)Convex optimizationBase stationWirelessFractional programmingMaximum power transfer theoremSubcarrierChannel (broadcasting)MIMOAlgorithmPower (physics)Nonlinear programmingRegular polygonMathematicsComputer networkTelecommunicationsOrthogonal frequency-division multiplexingTransmitter

Abstract

fetched live from OpenAlex

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.827
Threshold uncertainty score0.575

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.052
GPT teacher head0.280
Teacher spread0.228 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it