The University of Southampton
University of Southampton Institutional Repository

Secure hybrid A/D beamforming for hardware-efficient large-scale multiple-antenna SWIPT systems

Secure hybrid A/D beamforming for hardware-efficient large-scale multiple-antenna SWIPT systems
Secure hybrid A/D beamforming for hardware-efficient large-scale multiple-antenna SWIPT systems
In this work, we investigate the problem of secure communications in a downlink large-scale multi-antenna assisted simultaneous wireless information and power transfer (SWIPT) system, where a base station (BS) transmits signals to serve a number of information decoding (ID) and energy harvesting (EH) users. Considering that the EH users can potentially eavesdrop the ID users’ confidential information, we study the robust joint design of the hybrid analog-digital (A/D) beamforming (BF) matrices and of the artificial redundant signal (ARS) covariance matrix at the BS, where the aim is to maximize the worst-case sum secrecy rate for the ID users under a transmit power constraint, a nonlinear EH constraint and a unit-modulus constraint on the entries of the analog BF matrix. The corresponding optimization problem is very challenging due to the nonlinear and nonconvex objective function and constraints. Using innovative optimization techniques, we first transform the original problem into an equivalent but more tractable form, and then develop a novel joint iterative algorithm based on the penalty-concave-convex procedure (CCCP) for solving the resultant problem. We show that the proposed penalty-CCCP based algorithm for ARS-aided robust joint hybrid BF design converges to a Karush-Kuhn-Tucker solution of the original problem, and also analyze its computational complexity. Our simulation results verify that the resultant robust joint hybrid BF design algorithm relying on ARS significantly outperforms the conventional hybrid BF benchmark algorithms and efficiently achieves the performance of the fully-digital BF with reduced number of radio frequency chains and energy consumption.
Robust hybrid A/D beamforming, energy harvesting, joint optimization, large-scale multiple-antenna, secure communications
0090-6778
6141-6156
Cai, Yunlong
ed1440c3-10af-4b6c-9295-4b355d409a16
Cui, Fangyu
61932969-0c1d-47fc-b8df-80d0f9baa5cd
Shi, Qingjiang
b7a4b79b-d00c-444e-90c7-7569e9d83a28
Wu, Yongpeng
93de8f86-e9af-4a90-9306-4838183e57af
Champagne, Benoit
34637814-cef4-4177-b5fd-d748742be072
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Cai, Yunlong
ed1440c3-10af-4b6c-9295-4b355d409a16
Cui, Fangyu
61932969-0c1d-47fc-b8df-80d0f9baa5cd
Shi, Qingjiang
b7a4b79b-d00c-444e-90c7-7569e9d83a28
Wu, Yongpeng
93de8f86-e9af-4a90-9306-4838183e57af
Champagne, Benoit
34637814-cef4-4177-b5fd-d748742be072
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Cai, Yunlong, Cui, Fangyu, Shi, Qingjiang, Wu, Yongpeng, Champagne, Benoit and Hanzo, Lajos (2020) Secure hybrid A/D beamforming for hardware-efficient large-scale multiple-antenna SWIPT systems. IEEE Transactions on Communications, 68 (10), 6141-6156, [9133207]. (doi:10.1109/TCOMM.2020.3006913).

Record type: Article

Abstract

In this work, we investigate the problem of secure communications in a downlink large-scale multi-antenna assisted simultaneous wireless information and power transfer (SWIPT) system, where a base station (BS) transmits signals to serve a number of information decoding (ID) and energy harvesting (EH) users. Considering that the EH users can potentially eavesdrop the ID users’ confidential information, we study the robust joint design of the hybrid analog-digital (A/D) beamforming (BF) matrices and of the artificial redundant signal (ARS) covariance matrix at the BS, where the aim is to maximize the worst-case sum secrecy rate for the ID users under a transmit power constraint, a nonlinear EH constraint and a unit-modulus constraint on the entries of the analog BF matrix. The corresponding optimization problem is very challenging due to the nonlinear and nonconvex objective function and constraints. Using innovative optimization techniques, we first transform the original problem into an equivalent but more tractable form, and then develop a novel joint iterative algorithm based on the penalty-concave-convex procedure (CCCP) for solving the resultant problem. We show that the proposed penalty-CCCP based algorithm for ARS-aided robust joint hybrid BF design converges to a Karush-Kuhn-Tucker solution of the original problem, and also analyze its computational complexity. Our simulation results verify that the resultant robust joint hybrid BF design algorithm relying on ARS significantly outperforms the conventional hybrid BF benchmark algorithms and efficiently achieves the performance of the fully-digital BF with reduced number of radio frequency chains and energy consumption.

Text
manuscript-2 - Accepted Manuscript
Download (291kB)

More information

Accepted/In Press date: 28 June 2020
e-pub ahead of print date: 3 July 2020
Published date: October 2020
Additional Information: Funding Information: Manuscript received February 8, 2020; revised May 27, 2020; accepted June 28, 2020. Date of publication July 3, 2020; date of current version October 16, 2020. The work of Y. Cai was supported in part by the National Natural Science Foundation of China under Grants 61831004 and 61971376, the Zhejiang Provincial Natural Science Foundation for Distinguished Young Scholars under Grant LR19F010002, and the State Key Laboratory of Rail Traffic Control and Safety (Contract No. RCS2020K010), Beijing Jiaotong University. The work of Q. Shi was supported in part by the National Key Research and Development Project under grant 2017YFE0119300, and in part by the National Natural Science Foundation of China under Grants 61671411, 61731018 and U1709219. The work of Y. Wu is supported in part by the National Key R&D Program of China under Grant 2018YFB1801102, JiangXi Key R&D Program under Grant 20181ACE50028, National Natural Science Foundation of China under Grant 61701301, Young Elite Scientist Sponsorship Program by CAST, and the open research project of State Key Laboratory of Integrated Services Networks (Xidian University) under Grant ISN20-03. L. Hanzo would like to acknowledge the financial support of the Engineering and Physical Sciences Research Council projects EP/N004558/1, EP/P034284/1, EP/P034284/1, EP/P003990/1 (COALESCE), of the Royal Society’s Global Challenges Research Fund Grant as well as of the European Research Council’s Advanced Fellow Grant QuantCom. The associate editor coordinating the review of this article and approving it for publication was R. Zhang. (Corresponding author: Qingjiang Shi.) Yunlong Cai is with the Department of ISEE, Zhejiang University, Hangzhou 310027, China, and also with the State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, China (e-mail: ylcai521@gmail.com). Publisher Copyright: © 1972-2012 IEEE.
Keywords: Robust hybrid A/D beamforming, energy harvesting, joint optimization, large-scale multiple-antenna, secure communications

Identifiers

Local EPrints ID: 442175
URI: http://eprints.soton.ac.uk/id/eprint/442175
ISSN: 0090-6778
PURE UUID: 5befaf70-7fe9-4cbb-9cf3-f31f145da6bb
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 08 Jul 2020 16:30
Last modified: 07 Oct 2022 01:33

Export record

Altmetrics

Contributors

Author: Yunlong Cai
Author: Fangyu Cui
Author: Qingjiang Shi
Author: Yongpeng Wu
Author: Benoit Champagne
Author: Lajos Hanzo ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×