Loughborough University
Browse

Secure full-duplex two-way relaying for SWIPT

Download (354.95 kB)
journal contribution
posted on 2018-01-18, 10:46 authored by Alexander A. Okandeji, Muhammad R. Khandaker, Kai-Kit Wong, Gan Zheng, Yangyang Zhang, Zhongbin Zheng
This letter studies bi-directional secure information exchange in a simultaneous wireless information and power transfer (SWIPT) system enabled by a full-duplex (FD) multiple-input multiple-output (MIMO) amplify-and-forward (AF) relay. The AF relay injects artificial noise (AN) in order to confuse the eavesdropper. Specifically, we assume a zeroforcing (ZF) solution constraint to eliminate the residual self-interference (RSI). As a consequence, we address the optimal joint design of the ZF matrix and the AN covariance matrix at the relay node as well as the transmit power at the sources. We propose an alternating algorithm utilizing semi-definite programming (SDP) technique and one-dimensional searching to achieve the optimal solution. Simulation results are provided to demonstrate the effectiveness of the proposed algorithm.

Funding

This work was supported in part by the Presidential Special Scholarship Scheme for Innovation and Development, Federal Republic of Nigeria, and in part by the EPSRC under Grant EP/N008219/1. The work of G. Zheng was supported by the U.K. EPSRC under Grant EP/N007840/1.

History

School

  • Mechanical, Electrical and Manufacturing Engineering

Published in

IEEE Wireless Communications Letters

Citation

OKANDEJI, A.A. ... et al, 2017. Secure full-duplex two-way relaying for SWIPT. IEEE Wireless Communications Letters, 7 (3), pp.336-339.

Publisher

IEEE

Version

  • VoR (Version of Record)

Publisher statement

This work is made available according to the conditions of the Creative Commons Attribution 3.0 Unported (CC BY 3.0) licence. Full details of this licence are available at: http://creativecommons.org/licenses/by/3.0/

Publication date

2017-11-23

Notes

This is an Open Access Article. It is published by IEEE under the Creative Commons Attribution 3.0 Unported Licence (CC BY). Full details of this licence are available at: http://creativecommons.org/licenses/by/3.0/

ISSN

2162-2337

eISSN

2162-2345

Language

  • en