Relay Cooperative Beamforming Algorithm Based on Probabilistic Constraint in SWIPT Secrecy Networks

Zhentao Hu,Mingqi Jin,Dongdong Xie,Lin Zhou,Jifang Li

doi:10.1109/access.2020.3026359

Abstract

We explore physical layer security of simultaneous wireless information and power transfer (SWIPT) relay network in this paper. Modeling channel error between relay and eavesdroppers (Eves) as random channel state information (CSI) error, we present an algorithm to optimize secret rate of SWIPT in the constraints of relay forward power, receiver signal-to-interference-plus-noise ratio (SINR) and Eves SINR. A slack variable is introduced to decompose original non-convex problem into upper and lower sub-problems, meanwhile, Bernstein-type inequality is used to convert probability constraint of lower sub-problems to linear matrix inequality constraints. Simulation experiments show that the proposed algorithm obtains higher secret rate than that of zero-forcing algorithm and worst-case algorithm.

Highlights

Since having characteristics of being energy-saving, cheap, flexible and convenient, the wireless sensor network (WSN) has wide application in areas such as military, traffic control, environmental monitoring, and so on
CONTRIBUTIONS We explore the secure transmission strategy of the relay simultaneous wireless information and power transfer (SWIPT) system in this paper
COMPLEXITY ANALYSIS AND NUMERICAL RESULTS In this subsection, we evaluate the complexity of the proposed robust secure scheme

Summary

INTRODUCTION

Since having characteristics of being energy-saving, cheap, flexible and convenient, the wireless sensor network (WSN) has wide application in areas such as military, traffic control, environmental monitoring, and so on. Supposing the state priori information of channel is accurately known, Liu’s methods obtain optimum ERs energy collection efficiency under the system security rate constraint. Liu’s method to multiple-input multiple-output (MIMO) SWIPT system whose channel state priori information is accurately known, and get optimum system security rate under the constraint of energy collection efficiency and power of transmitter [7]. Similar to REN Yuan’s method, B.Li explores the problem of maximizing the secrecy rate in imperfect CSI at the transmitter and IRs [13] Their works use norm-bounded deterministic CSI error model, since the bound of CSI cannot be obtained exactly in engineering practice and the probability of the worst-case CSI error is very low, their work seems too idealistic and conservative. The Hermitian conjugate transpose, transpose, rank and trace of a matrix A are denoted by AH , AT , rank (A), respectively. vec (A) is the vectorization of the matrix A; CN is the sets of complex N-dimensional vectors; I denotes the identity matrix; diag (v) is the diagonal matrix with the vector v on the diagonal

SYSTEM MODEL AND PROBLEM FORMULATION

COMPLEXITY ANALYSIS AND NUMERICAL RESULTS

CONCLUSION