IRS-Aided Uplink Transmission Scheme in Integrated Satellite-Terrestrial Networks
This paper proposes an intelligent reflecting surface (IRS)-aided uplink transmission scheme to expand the wireless coverage and improve spectral efficiency for an integrated satellite-terrestrial network (ISTN). Here, multiple earth stations communicate with the satellite via non-orthogonal multipl...
Saved in:
Published in | IEEE transactions on vehicular technology Vol. 72; no. 2; pp. 1 - 14 |
---|---|
Main Authors | , , , , , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.02.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper proposes an intelligent reflecting surface (IRS)-aided uplink transmission scheme to expand the wireless coverage and improve spectral efficiency for an integrated satellite-terrestrial network (ISTN). Here, multiple earth stations communicate with the satellite via non-orthogonal multiple access (NOMA) technology, while multiple direct users and blockage users access the cellular network through space division multiple access and IRS-aided NOMA technology, respectively. In particular, we first aim at maximizing the ergodic sum rate of the ISTN subject to the quality-of-service requirements and transmit power budgets of all users, yielding a constrained optimization problem. Then, based on the assumption that only the statistical channel state information (CSI) is available, we propose a two-layer alternating algorithm to solve the non-convex original problem. The algorithm combines successive convex approximation with S -procedure approach to calculate the phase shifts of IRS and transmit powers of all users in the first layer, and uses Charnes-Cooper method with semi-definite programming to calculate beamforming vectors at the BS in the second layer. Furthermore, with the help of the zero-forcing beamforming principle, we propose a low-complexity algorithm to solve the problem that can reduce the computational load effectively. Finally, simulation results demonstrate that our proposed algorithms can obtain a higher ergodic sum rate than the benchmarks. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 0018-9545 1939-9359 |
DOI: | 10.1109/TVT.2022.3208101 |