DCA approaches for simultaneous wireless information power transfer in MISO secrecy channel

This paper addresses the emerging practical requirement that wireless information and power transfer are employed simultaneously in a multiple-input single-output (MISO) secrecy channel. Transmit beamforming without artificial noise and that with artificial noise are considered. In addition, perfect...

Full description

Saved in:
Bibliographic Details
Published in:Optimization and engineering Vol. 24; no. 1; pp. 5 - 29
Main Authors: Nguyen, Phuong Anh, Le Thi, Hoai An
Format: Journal Article
Language:English
Published: New York Springer US 01.03.2023
Springer Verlag
Subjects:
Computer Science
Control
Engineering
Environmental Management
Financial Engineering
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Research Article
Systems Theory
DC programming
Physical layer security
Beamforming
DCA
SWIPT
Artificial noise
ISSN:1389-4420, 1573-2924
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper addresses the emerging practical requirement that wireless information and power transfer are employed simultaneously in a multiple-input single-output (MISO) secrecy channel. Transmit beamforming without artificial noise and that with artificial noise are considered. In addition, perfect and imperfect channel state information of both the legitimate receivers and eavesdroppers are investigated. These four scenarios correspond to four optimization problems. The considered problems aim to maximize the secrecy rate with constraints on the transmit power and the harvested energy at each receiver. Since these optimization problems are nonconvex, we propose the efficient algorithms based on Difference of Convex (DC) functions programming and DC Algorithm (DCA )—an innovative approach in nonconvex optimization. Exploiting the special structure of these problems, we utilize the semidefinite relaxation technique and S-procedure to reformulate them as general DC programs. The efficient algorithms based on general DCA are developed to solve the corresponding general DC programs. Numerical results are presented which illustrate the effectiveness of our proposed algorithms, they outperform the existing approaches in terms of both quality and rapidity.
ISSN:1389-4420
1573-2924
DOI:10.1007/s11081-020-09570-3