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

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

IRS-Aided Wireless Powered MEC Systems: TDMA or NOMA for Computation Offloading?

Open access
Chen, Guangji, Wu, Qingqing, Chen, Wen, Ng, Derrick Wing Kwan, Hanzo, Lajos · 2023 · IEEE Transactions on Wireless Communications

Abstract

Anintelligent reflecting surface (IRS)-aided wireless-powered mobile edge computing (WP-MEC) system is conceived, where each device’s computational task can be divided into two parts for local computing and offloading to mobile edge computing (MEC) servers, respectively. Both time division multiple access (TDMA) and non-orthogonal multiple access (NOMA) schemes are considered for uplink (UL) offloading. To fully unleash the potential benefits of the IRS, employing multiple IRS beamforming (BF) patterns/vectors in the considered operating frame to create time-selectivity channels, i.e., dynamic IRS BF (DIBF), is in principle possible at the cost of additional signaling overhead. To strike a balance between the system performance and associated signalling overhead, we propose three cases of DIBF configurations based on the maximum number of IRS reconfiguration times. The degree-of-freedom provided by the IRS may introduce different impacts on the TDMA and NOMA-based UL offloading schemes. Thus, it is still fundamentally unknown which multiple access scheme is superior for MEC UL offloading by considering the impact of the IRS. To answer this question, we provide a comprehensively theoretical performance comparison for the TDMA and NOMA-based offloading schemes under the three cases of DIBF configurations by characterizing their achievable computation rate. Analytical results demonstrate that offloading adopting TDMA can achieve the same computation rate as that of NOMA, when all the devices share the same IRS BF vector during the UL offloading. By contrast, computation offloading exploiting TDMA outperforms NOMA, when the IRS BF vector can be flexibly adapted for UL offloading. Then, we propose computationally efficient algorithms by invoking alternating optimization for solving their associated computation rate maximization problems. Our numerical results demonstrate the significant performance gains achieved by the proposed designs over various benchmark schemes and also unveil that the optimal time allocated to downlink wireless power transfer can be effectively reduced with the aid of IRSs, which is beneficial for both the system’s spectral efficiency and its energy efficiency.

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.2022.3203158

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 160

Metadata

Authors
Chen, G., Wu, Q., Chen, W., Ng, D. W. K., & Hanzo, L.
Venue
IEEE Transactions on Wireless Communications
Published
2023-02
Volume
22
Issue
2
Pages
1201-1218
ISSN
  • 1536-1276 (ISSN-L)
  • 1558-2248
OpenAlex
W3193353357
Cited by
160
References
3
FWCI
10.04
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.