The University of Southampton
University of Southampton Institutional Repository

Cooperative secure transmission relying on the optimal power allocation in the presence of untrusted relays, a passive eavesdropper and hardware impairments

Cooperative secure transmission relying on the optimal power allocation in the presence of untrusted relays, a passive eavesdropper and hardware impairments
Cooperative secure transmission relying on the optimal power allocation in the presence of untrusted relays, a passive eavesdropper and hardware impairments
In this work, by considering a variety of realistic hardware impairments, we aim to enhance the security of a cooperative relaying network, where a source intends to transmit its confidential information to a destination in the presence of a group of untrusted amplify-and-forward relays, as potential eavesdroppers (Eves), and an entirely passive multiple-antenna aided Eve. Our goal is to safeguard the information against these two types of eavesdropping attacks, while simultaneously relying on the untrusted relays to boost both the security and reliability of the network. To reach this goal, we propose a novel joint cooperative beamforming, jamming and power allocation policy to safeguard the confidential information while concurrently achieving the required quality-of-service at the destination. We also take into account both the total power budget constraint and a practical individual power constraint for each node. Our optimization problem can be split into two consecutive sub-problems. In the first sub-problem, we are faced with a non-convex problem which can be transformed into the powerful difference of convex (DC) program. A low-complexity iterative algorithm is proposed to solve the DC program, which relies on the constrained concave-convex procedure (CCCP). We further introduce a novel initialization method, which is based on a feasible point of the original problem obtained from a novel iterative feasibility search procedure, rather than an arbitrary (infeasible) point as in the conventional CCCP. The second sub-problem of our optimization problem is a convex optimization problem and can be solved efficiently adopting the classic interior point method. The numerical results provided illustrate that although the trusted relaying scenario outperforms the untrusted relaying for small and medium total power budgets, however, by increasing the total power budget, the secrecy performances of both the trusted and untrusted relaying converge to the same. Additionally, by equally sharing the total impairments at the relays between the transmitter and the receiver the best secrecy performance is presented.
2169-3536
116942-116964
Moradikia, Majid
1754cc48-3308-4843-9488-23d2041cd0a4
Bastami, Hamed
ee4038a4-0c2c-4ae8-8cd9-a4fc2edcafb3
Kuhestani, Ali
e0d2fc3e-533f-4763-a7b0-17c96cf0bc26
Behroozi, Hamid
ce71a8d4-f34f-4007-ae71-cdde7f6da0cb
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Moradikia, Majid
1754cc48-3308-4843-9488-23d2041cd0a4
Bastami, Hamed
ee4038a4-0c2c-4ae8-8cd9-a4fc2edcafb3
Kuhestani, Ali
e0d2fc3e-533f-4763-a7b0-17c96cf0bc26
Behroozi, Hamid
ce71a8d4-f34f-4007-ae71-cdde7f6da0cb
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Moradikia, Majid, Bastami, Hamed, Kuhestani, Ali, Behroozi, Hamid and Hanzo, Lajos (2019) Cooperative secure transmission relying on the optimal power allocation in the presence of untrusted relays, a passive eavesdropper and hardware impairments. IEEE Access, 7, 116942-116964. (doi:10.1109/ACCESS.2019.2936098).

Record type: Article

Abstract

In this work, by considering a variety of realistic hardware impairments, we aim to enhance the security of a cooperative relaying network, where a source intends to transmit its confidential information to a destination in the presence of a group of untrusted amplify-and-forward relays, as potential eavesdroppers (Eves), and an entirely passive multiple-antenna aided Eve. Our goal is to safeguard the information against these two types of eavesdropping attacks, while simultaneously relying on the untrusted relays to boost both the security and reliability of the network. To reach this goal, we propose a novel joint cooperative beamforming, jamming and power allocation policy to safeguard the confidential information while concurrently achieving the required quality-of-service at the destination. We also take into account both the total power budget constraint and a practical individual power constraint for each node. Our optimization problem can be split into two consecutive sub-problems. In the first sub-problem, we are faced with a non-convex problem which can be transformed into the powerful difference of convex (DC) program. A low-complexity iterative algorithm is proposed to solve the DC program, which relies on the constrained concave-convex procedure (CCCP). We further introduce a novel initialization method, which is based on a feasible point of the original problem obtained from a novel iterative feasibility search procedure, rather than an arbitrary (infeasible) point as in the conventional CCCP. The second sub-problem of our optimization problem is a convex optimization problem and can be solved efficiently adopting the classic interior point method. The numerical results provided illustrate that although the trusted relaying scenario outperforms the untrusted relaying for small and medium total power budgets, however, by increasing the total power budget, the secrecy performances of both the trusted and untrusted relaying converge to the same. Additionally, by equally sharing the total impairments at the relays between the transmitter and the receiver the best secrecy performance is presented.

Text
CCCP_paper - Accepted Manuscript
Available under License Creative Commons Attribution.
Download (1MB)

More information

Accepted/In Press date: 8 August 2019
e-pub ahead of print date: 19 August 2019

Identifiers

Local EPrints ID: 433289
URI: http://eprints.soton.ac.uk/id/eprint/433289
ISSN: 2169-3536
PURE UUID: 0916aed0-e067-4b79-ba80-0aeefeaeaef2
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 13 Aug 2019 16:30
Last modified: 18 Mar 2024 05:13

Export record

Altmetrics

Contributors

Author: Majid Moradikia
Author: Hamed Bastami
Author: Ali Kuhestani
Author: Hamid Behroozi
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.

×