LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

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

Photo by bradencollum from unsplash

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… Click to show full 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.

Keywords: swipt; beamforming algorithm; relay cooperative; constraint; cooperative beamforming; algorithm

Journal Title: IEEE Access
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.