The University of Southampton
University of Southampton Institutional Repository

Robust beamforming and jamming for enhancing the physical layer security of full duplex radios

Robust beamforming and jamming for enhancing the physical layer security of full duplex radios
Robust beamforming and jamming for enhancing the physical layer security of full duplex radios
In this paper, we investigate the physical layer security of a full-duplex base station (BS)-aided system in the worst case, where an uplink transmitter (UT) and a downlink receiver (DR) are equipped with a single antenna, while a powerful eavesdropper is equipped with multiple antennas. For securing the confidentiality of signals transmitted from the BS and UT, an artificial noise (AN)-aided secrecy beamforming scheme is proposed, which is robust to the realistic imperfect state information of both the eavesdropping channel and the residual self-interference channel. Our objective function is that of maximizing the worst-case sum secrecy rate achieved by the BS and UT, through jointly optimizing the beamforming vector of the confidential signals and the transmit covariance matrix of the AN. However, the resulting optimization problem is non-convex and non-linear. In order to efficiently obtain the solution, we transform the non-convex problem into a sequence of convex problems by adopting the block coordinate descent algorithm. We invoke a linear matrix inequality for finding its Karush–Kuhn–Tucker (KKT) solution. In order to evaluate the achievable performance, the worst-case secrecy rate is analytically derived. Furthermore, we construct another secrecy transmission scheme using the projection matrix theory for performance comparison. Our simulation results show that the proposed robust secrecy transmission scheme achieves substantial secrecy performance gains, which verifies the efficiency of the proposed method.
1556-6013
3151-3159
Kong, Zhengmin
99641cb0-a364-4eb2-b838-1af3cbb297b8
Yang, Shaoshi
df1e6c38-ff3b-473e-b36b-4820db908e60
Wang, Die
78853293-8e9f-4c11-84a8-b4ca71e9c326
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Kong, Zhengmin
99641cb0-a364-4eb2-b838-1af3cbb297b8
Yang, Shaoshi
df1e6c38-ff3b-473e-b36b-4820db908e60
Wang, Die
78853293-8e9f-4c11-84a8-b4ca71e9c326
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Kong, Zhengmin, Yang, Shaoshi, Wang, Die and Hanzo, Lajos (2019) Robust beamforming and jamming for enhancing the physical layer security of full duplex radios. IEEE Transactions on Information Forensics and Security, 14 (12), 3151-3159. (doi:10.1109/TIFS.2019.2908481).

Record type: Article

Abstract

In this paper, we investigate the physical layer security of a full-duplex base station (BS)-aided system in the worst case, where an uplink transmitter (UT) and a downlink receiver (DR) are equipped with a single antenna, while a powerful eavesdropper is equipped with multiple antennas. For securing the confidentiality of signals transmitted from the BS and UT, an artificial noise (AN)-aided secrecy beamforming scheme is proposed, which is robust to the realistic imperfect state information of both the eavesdropping channel and the residual self-interference channel. Our objective function is that of maximizing the worst-case sum secrecy rate achieved by the BS and UT, through jointly optimizing the beamforming vector of the confidential signals and the transmit covariance matrix of the AN. However, the resulting optimization problem is non-convex and non-linear. In order to efficiently obtain the solution, we transform the non-convex problem into a sequence of convex problems by adopting the block coordinate descent algorithm. We invoke a linear matrix inequality for finding its Karush–Kuhn–Tucker (KKT) solution. In order to evaluate the achievable performance, the worst-case secrecy rate is analytically derived. Furthermore, we construct another secrecy transmission scheme using the projection matrix theory for performance comparison. Our simulation results show that the proposed robust secrecy transmission scheme achieves substantial secrecy performance gains, which verifies the efficiency of the proposed method.

Text
IEEE_journal_Double - Accepted Manuscript
Download (415kB)

More information

Accepted/In Press date: 22 March 2019
e-pub ahead of print date: 1 April 2019
Published date: December 2019

Identifiers

Local EPrints ID: 429421
URI: http://eprints.soton.ac.uk/id/eprint/429421
ISSN: 1556-6013
PURE UUID: fe68b5fc-b211-4081-afe3-84e5790f3629
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 27 Mar 2019 17:30
Last modified: 18 Mar 2024 02:36

Export record

Altmetrics

Contributors

Author: Zhengmin Kong
Author: Shaoshi Yang
Author: Die Wang
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.

×