Secure Beamforming Designs for Secrecy MIMO SWIPT Systems

Zhengyu Zhu, Zheng Chu, Fuhui Zhou, Hehao Niu, Zhongyong Wang, Inkyu Lee

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

In this letter, secure beamforming designs are investigated in a multiple-input multiple-output (MIMO) secrecy channels with simultaneous wireless information and power transfer (SWIPT). In order to achieve fairness among different multiple energy harvesting receivers (EHRs), the minimum harvested energy is maximized under the secrecy rate requirements. In particular, in order to reduce the computational complexity of the semidefinite programming (SDP) problem, a successive convex approximation (SCA) iterative algorithm is proposed in the perfect channel state information (CSI) case to obtain a near-optimal rank-one solution. Moreover, the original problem is extended to the imperfect CSI case by incorporating a norm-bounded error model, where a SCA-based iterative algorithm is also proposed. Simulation results reveal that the SCA-based iterative algorithm achieve the same performance as the semidefinite relaxation (SDR) method with reduced complexity.

Original languageEnglish
JournalIEEE Wireless Communications Letters
DOIs
Publication statusAccepted/In press - 2017 Dec 6

Fingerprint

Beamforming
Channel state information
Energy harvesting
Computational complexity

Keywords

  • MIMO system
  • secure beamforming
  • semidefinite relaxation.
  • successive convex approximation
  • SWIPT

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Secure Beamforming Designs for Secrecy MIMO SWIPT Systems. / Zhu, Zhengyu; Chu, Zheng; Zhou, Fuhui; Niu, Hehao; Wang, Zhongyong; Lee, Inkyu.

In: IEEE Wireless Communications Letters, 06.12.2017.

Research output: Contribution to journalArticle

Zhu, Zhengyu ; Chu, Zheng ; Zhou, Fuhui ; Niu, Hehao ; Wang, Zhongyong ; Lee, Inkyu. / Secure Beamforming Designs for Secrecy MIMO SWIPT Systems. In: IEEE Wireless Communications Letters. 2017.
@article{c0740c865f5d496e97357dd543841882,
title = "Secure Beamforming Designs for Secrecy MIMO SWIPT Systems",
abstract = "In this letter, secure beamforming designs are investigated in a multiple-input multiple-output (MIMO) secrecy channels with simultaneous wireless information and power transfer (SWIPT). In order to achieve fairness among different multiple energy harvesting receivers (EHRs), the minimum harvested energy is maximized under the secrecy rate requirements. In particular, in order to reduce the computational complexity of the semidefinite programming (SDP) problem, a successive convex approximation (SCA) iterative algorithm is proposed in the perfect channel state information (CSI) case to obtain a near-optimal rank-one solution. Moreover, the original problem is extended to the imperfect CSI case by incorporating a norm-bounded error model, where a SCA-based iterative algorithm is also proposed. Simulation results reveal that the SCA-based iterative algorithm achieve the same performance as the semidefinite relaxation (SDR) method with reduced complexity.",
keywords = "MIMO system, secure beamforming, semidefinite relaxation., successive convex approximation, SWIPT",
author = "Zhengyu Zhu and Zheng Chu and Fuhui Zhou and Hehao Niu and Zhongyong Wang and Inkyu Lee",
year = "2017",
month = "12",
day = "6",
doi = "10.1109/LWC.2017.2780830",
language = "English",
journal = "IEEE Wireless Communications Letters",
issn = "2162-2337",
publisher = "IEEE Communications Society",

}

TY - JOUR

T1 - Secure Beamforming Designs for Secrecy MIMO SWIPT Systems

AU - Zhu, Zhengyu

AU - Chu, Zheng

AU - Zhou, Fuhui

AU - Niu, Hehao

AU - Wang, Zhongyong

AU - Lee, Inkyu

PY - 2017/12/6

Y1 - 2017/12/6

N2 - In this letter, secure beamforming designs are investigated in a multiple-input multiple-output (MIMO) secrecy channels with simultaneous wireless information and power transfer (SWIPT). In order to achieve fairness among different multiple energy harvesting receivers (EHRs), the minimum harvested energy is maximized under the secrecy rate requirements. In particular, in order to reduce the computational complexity of the semidefinite programming (SDP) problem, a successive convex approximation (SCA) iterative algorithm is proposed in the perfect channel state information (CSI) case to obtain a near-optimal rank-one solution. Moreover, the original problem is extended to the imperfect CSI case by incorporating a norm-bounded error model, where a SCA-based iterative algorithm is also proposed. Simulation results reveal that the SCA-based iterative algorithm achieve the same performance as the semidefinite relaxation (SDR) method with reduced complexity.

AB - In this letter, secure beamforming designs are investigated in a multiple-input multiple-output (MIMO) secrecy channels with simultaneous wireless information and power transfer (SWIPT). In order to achieve fairness among different multiple energy harvesting receivers (EHRs), the minimum harvested energy is maximized under the secrecy rate requirements. In particular, in order to reduce the computational complexity of the semidefinite programming (SDP) problem, a successive convex approximation (SCA) iterative algorithm is proposed in the perfect channel state information (CSI) case to obtain a near-optimal rank-one solution. Moreover, the original problem is extended to the imperfect CSI case by incorporating a norm-bounded error model, where a SCA-based iterative algorithm is also proposed. Simulation results reveal that the SCA-based iterative algorithm achieve the same performance as the semidefinite relaxation (SDR) method with reduced complexity.

KW - MIMO system

KW - secure beamforming

KW - semidefinite relaxation.

KW - successive convex approximation

KW - SWIPT

UR - http://www.scopus.com/inward/record.url?scp=85037593259&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85037593259&partnerID=8YFLogxK

U2 - 10.1109/LWC.2017.2780830

DO - 10.1109/LWC.2017.2780830

M3 - Article

JO - IEEE Wireless Communications Letters

JF - IEEE Wireless Communications Letters

SN - 2162-2337

ER -