Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 232

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Joint Beamforming Design and Power Splitting Optimization in IRS-Assisted SWIPT NOMA Networks

Open access
Li, Zhendong, Chen, Wen, Wu, Qingqing, Wang, Kunlun, Li, Jun · 2022 · IEEE Transactions on Wireless Communications

Abstract

This paper proposes a novel network framework of intelligent reflecting surface (IRS)-assisted simultaneous wireless information and power transfer (SWIPT) non-orthogonal multiple access (NOMA) networks, where IRS is used to enhance the NOMA performance and the wireless power transfer (WPT) efficiency of SWIPT. We formulate a problem of minimizing base station (BS) transmit power by jointly optimizing successive interference cancellation (SIC) decoding order, BS transmit beamforming vector, power splitting (PS) ratio and IRS phase shift while taking into account the quality-of-service (QoS) requirement and energy harvested threshold of each user. The formulated problem is non-convex optimization problem, which is difficult to solve it directly. Hence, a two-stage algorithm is proposed to solve the above-mentioned problem by applying semidefinite relaxation (SDR), Gaussian randomization and successive convex approximation (SCA). Specifically, after determining SIC decoding order by designing IRS phase shift in the first stage, we alternately optimize BS transmit beamforming vector, PS ratio, and IRS phase shift to minimize the BS transmit power. Numerical results validate the effectiveness of our proposed optimization algorithm in reducing BS transmit power compared to other baseline algorithms. Meanwhile, compared with non-IRS-assisted network, the IRS-assisted SWIPT NOMA network can decrease BS transmit power by 51.13%.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/twc.2021.3108901

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 232

Metadata

Authors
Li, Z., Chen, W., Wu, Q., Wang, K., & Li, J.
Venue
IEEE Transactions on Wireless Communications
Published
2022-03
Volume
21
Issue
3
Pages
2019-2033
ISSN
  • 1536-1276 (ISSN-L)
  • 1558-2248
OpenAlex
W3198789116
Cited by
232
References
3
FWCI
11.74
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.