Robust Design for Intelligent Reflecting Surface-Assisted Secrecy SWIPT Network

Hehao Niu, Zheng Chu, Fuhui Zhou, Zhengyu Zhu, Li Zhen, Kai Kit Wong

Research output: Journal PublicationArticlepeer-review

50 Citations (Scopus)

Abstract

This paper investigates the robust beamforming design in a secrecy multiple-input single-output (MISO) network aided by the intelligent reflecting surface (IRS) with simultaneous wireless information and power transfer (SWIPT). Specifically, by considering that the energy receivers (ERs) are potential eavesdroppers (Eves) and imperfect channel state information (CSI) of the direct and cascaded channels can be obtained, we investigate the max-min fairness robust secrecy design. The objective is to maximize the minimum robust information rate among the legitimate information receivers (IRs). To solve the formulated non-convex design problem in bounded and probabilistic CSI error models, we utilize the alternating optimization (AO) and successive convex approximation (SCA) methods to obtain an approximate problem. Then, an iteration-based algorithm framework was proposed, where the unit modulus constraint (UMC) of the IRS is handled by the penalty dual decomposition (PDD) method. Moreover, a stochastic SCA method is proposed to handle the outage constrained design with statistical CSI. Finally, simulation results validate the promising performance of the proposed design.

Original languageEnglish
Pages (from-to)4133-4149
Number of pages17
JournalIEEE Transactions on Wireless Communications
Volume21
Issue number6
DOIs
Publication statusPublished - 1 Jun 2022
Externally publishedYes

Keywords

  • Intelligent reflecting surface
  • alternating optimization
  • penalty dual decomposition

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Robust Design for Intelligent Reflecting Surface-Assisted Secrecy SWIPT Network'. Together they form a unique fingerprint.

Cite this