Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Access

Cooperative Secure Transmission Relying on Optimal Power Allocation in the Presence of Untrusted Relays, A Passive Eavesdropper and Hardware Impairments

Majid Moradikia, Hamed Bastami, Ali Kuhestani, Hamid Behroozi, Lajos Hanzo

Published Jan 1, 2019• 36 citations
Publisher

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.

DOI
10.1109/access.2019.2936098

Related papers

Joint optimal power allocation, cooperative beamforming, and jammer selection design to secure untrusted relaying network

Majid Moradikia, Saeed Mashdour, Ali Jamshidi

Abstract A half‐duplex relaying network provides 2 opportunities for passive eavesdroppers (Eves) and 1 opportunity for untrusted relays to intercept the information. In this paper, we aim to enhance the physical layer security of a cooperative network where a single‐antenna source intends to communicate with a single‐antenna destination in the presence of a group of untrusted relays and a passive eavesdropper. The objective is to protect the data confidentially while concurrently relying on the untrusted relays as potential Eves to improve both the security and reliability of the network. To realize this objective, we design a joint cooperative beamforming and cooperative jamming strategy. With the aim of maximizing the instantaneous secrecy rate, an optimal power allocation (OPA) scheme is proposed where the transmission powers of both jammer and source are optimized simultaneously under the total power budget constraint. To further improve the secrecy rate, a jammer selection strategy is also proposed where cooperative jamming is performed by the destination or one of the idle relays. For the proposed scheme, a closed‐form expression of beamformer vector is derived by solving a generalized eigenvalue problem. Finally, for the OPA problem, it is possible to be neither convex nor concave. In this regard, all possible cases are investigated to determine the OPA factor accurately. Numerical results illustrate that the proposed joint OPA–cooperative beamforming scheme, together with the most appropriate jammer selection strategy, significantly increases the secrecy rate.

Transactions on Emerging Telecommunications Technologies•Jan 18, 2018•12 citations

Secrecy Rate Maximization for Hardware Impaired Untrusted Relaying Network with Deep Learning

Hamed Bastami, Majid Moradikia, Hamid Behroozi +3 more

This paper investigates the physical layer security design of an untrusted relaying network where the source node coexists with a multi-antenna eavesdropper (Eve). While the communication relies on untrustworthy relay nodes to increase reliability, we aim to protect the confidentiality of information against combined eavesdropping attacks performed by both untrusted relay nodes and Eve. Taking into account the hardware impairments, and power budget constraints, this paper presents a novel approach to jointly optimize relay beamformer and transmit powers aimed at maximizing average secrecy rate (ASR). The resultant optimization problem is non-convex, and a suboptimal solution is obtained through the sequential parametric convex approximation (SPCA) method. In order to prevent any failure due to infeasibility, we propose an iterative initialization algorithm to find the feasible initial point of the original problem. To satisfy low-latency as one of the main key performance indicators (KPI) required in beyond 5G (B5G) communications, a computationally efficient data-driven approach is developed exploiting a deep learning model to improve the ASR while the computational burden is significantly reduced. Simulation results assess the effect of different system parameters on the ASR performance as well as the effectiveness of the proposed deep learning solution in large-scale cases.

arXiv:2101.02749•Jan 7, 2021•2 citations

Joint Relay Selection and Power Allocation in Large-Scale MIMO Systems with Untrusted Relays and Passive Eavesdroppers

Ali Kuhestani, Abbas Mohammadi, Mohammadali Mohammadi

In this paper, a joint relay selection and power allocation (JRP) scheme is proposed to enhance the physical layer security of a cooperative network, where a multiple antennas source communicates with a single-antenna destination in the presence of untrusted relays and passive eavesdroppers (Eves). The objective is to protect the data confidentially while concurrently relying on the untrusted relays as potential Eves to improve both the security and reliability of the network. To realize this objective, we consider cooperative jamming performed by the destination while the JRP scheme is implemented. With the aim of maximizing the instantaneous secrecy rate, we derive a new closed-form solution for the optimal power allocation and propose a simple relay selection criterion under two scenarios of non-colluding Eves (NCE) and colluding Eves (CE). For the proposed scheme, a new closed-form expression is derived for the ergodic secrecy rate (ESR) and the secrecy outage probability as security metrics, and a new closed-form expression is presented for the average symbol error rate as a reliability measure over Rayleigh fading channels. We further explicitly characterize the high signal-to-noise ratio slope and power offset of the ESR to highlight the impacts of system parameters on the ESR. In addition, we examine the diversity order of the proposed scheme to reveal the achievable secrecy performance advantage. Finally, the secrecy and reliability diversity-multiplexing tradeoff of the optimized network are provided. Numerical results highlight that the ESR performance of the proposed JRP scheme for NCE and CE cases is increased with respect to the number of untrustworthy relays.

arXiv:1709.01341•IEEE Transactions on Information Forensics and Security•Jan 1, 2017•102 citations

Joint Beamforming and Power Allocation for Secrecy in Peer-to-Peer Relay Networks

Chao Wang, Hui‐Ming Wang, Derrick Wing Kwan Ng +2 more

This paper investigates the physical-layer security of a multiuser peer-to-peer (MUP2P) relay network for amplify-and-forward (AF) protocol, where a secure user and other unclassified users coexist with a multi-antenna eavesdropper and the eavesdropper can wiretap the confidential information in both two cooperative phases. Our goal is to optimize the transmit power of the source and the beamforming weights of the relays jointly for secrecy rate maximization subject to the minimum signal-to-interference-noise-ratio (SINR) constraint at each user, and the individual and total power constraints. Mathematically, the optimization problem is non-linear and non-convex, which does not facilitate an efficient resource allocation algorithm design. As an alternative, a null space beamforming scheme is adopted at the relays for simplifying the joint optimization and eliminating the confidential information leakage in the second cooperative phase, where the relay beamforming vector lies in the null space of the equivalent channel of the relay to eavesdropper links. Although the null space beamforming scheme simplifies the design of resource allocation algorithm, the considered problem is still non-convex and obtaining the global optimum is very difficult, if not impossible. Employing a sequential parametric convex approximation (SPCA) method, we propose an iterative algorithm to obtain an efficient solution of the non-convex problem. Besides, the proposed joint design algorithm requires a feasible starting point, we also propose a low complexity feasible initial points searching algorithm. Simulations demonstrate the validity of the proposed strategy.

IEEE Transactions on Wireless Communications•Feb 13, 2015•88 citations

Optimal Power Allocation by Imperfect Hardware Analysis in Untrusted Relaying Networks

Ali Kuhestani, Abbas Mohammadi, Kai‐Kit Wong +3 more

By taking a variety of realistic hardware imperfections into consideration, we propose an optimal power allocation (OPA) strategy to maximize the instantaneous secrecy rate of a cooperative wireless network comprised of a source, a destination, and an untrusted amplify-and-forward relay. We assume that either the source or the destination is equipped with a large-scale multiple antennas' system, while the rest are equipped with a single antenna. To prevent the untrusted relay from intercepting the source message, the destination sends an intended jamming noise to the relay, which is referred to as destination-based cooperative jamming. Given this system model, novel closed-form expressions are presented in the high signal-to-noise ratio regime for the ergodic secrecy rate and the secrecy outage probability. We further improve the secrecy performance of the system by optimizing the associated hardware design. The results reveal that by beneficially distributing the tolerable hardware imperfections across the transmission and reception radio-frequency front ends of each node, the system's secrecy rate may be improved. The engineering insight is that equally sharing the total imperfections at the relay between the transmitter and the receiver provides the best secrecy performance. Numerical results illustrate that the proposed OPA together with the most appropriate hardware design significantly increases the secrecy rate.

arXiv:1709.01334•IEEE Transactions on Wireless Communications•Apr 10, 2018•43 citations

To secure amplify-and-forward relay systems via joint cooperative beamforming and jamming

Hui‐Ming Wang, Xiang‐Gen Xia, Qinye Yin

Securing the wireless transmissions in the physical layer is a new perspective of security. In a wireless relay system, cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security in the presence of passive eavesdroppers. However, in most works these two techniques are used in phase II of the cooperative transmission, which leaves the phase I out of protection. In this paper, we propose a joint cooperative beamforming and jamming scheme to enhance the security of a cooperative relay network, where a part of intermediate nodes adopt distributed beamforming while others jam the eavesdropper, simultaneously, such that both phases are secured. Since the instantaneous channel state information (CSI) of the eavesdropper may not be known, we propose a cooperative artificial noise transmission based secrecy strategy, subjected to the individual power constraint of each node. The beamformer weights and power allocation can be obtained by solving a second-order convex cone programming (SOCP) together with a linear programming problem. Simulations show the joint scheme greatly improves the security.

IEEE China Summit and International Conference on Signal and Information Processing (ChinaSIP)•Jul 1, 2013•4 citations
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.
Abstract A half‐duplex relaying network provides 2 opportunities for passive eavesdroppers (Eves) and 1 opportunity for untrusted relays to intercept the information. In this paper, we aim to enhance the physical layer security of a cooperative network where a single‐antenna source intends to communicate with a single‐antenna destination in the presence of a group of untrusted relays and a passive eavesdropper. The objective is to protect the data confidentially while concurrently relying on the untrusted relays as potential Eves to improve both the security and reliability of the network. To realize this objective, we design a joint cooperative beamforming and cooperative jamming strategy. With the aim of maximizing the instantaneous secrecy rate, an optimal power allocation (OPA) scheme is proposed where the transmission powers of both jammer and source are optimized simultaneously under the total power budget constraint. To further improve the secrecy rate, a jammer selection strategy is also proposed where cooperative jamming is performed by the destination or one of the idle relays. For the proposed scheme, a closed‐form expression of beamformer vector is derived by solving a generalized eigenvalue problem. Finally, for the OPA problem, it is possible to be neither convex nor concave. In this regard, all possible cases are investigated to determine the OPA factor accurately. Numerical results illustrate that the proposed joint OPA–cooperative beamforming scheme, together with the most appropriate jammer selection strategy, significantly increases the secrecy rate.
This paper investigates the physical layer security design of an untrusted relaying network where the source node coexists with a multi-antenna eavesdropper (Eve). While the communication relies on untrustworthy relay nodes to increase reliability, we aim to protect the confidentiality of information against combined eavesdropping attacks performed by both untrusted relay nodes and Eve. Taking into account the hardware impairments, and power budget constraints, this paper presents a novel approach to jointly optimize relay beamformer and transmit powers aimed at maximizing average secrecy rate (ASR). The resultant optimization problem is non-convex, and a suboptimal solution is obtained through the sequential parametric convex approximation (SPCA) method. In order to prevent any failure due to infeasibility, we propose an iterative initialization algorithm to find the feasible initial point of the original problem. To satisfy low-latency as one of the main key performance indicators (KPI) required in beyond 5G (B5G) communications, a computationally efficient data-driven approach is developed exploiting a deep learning model to improve the ASR while the computational burden is significantly reduced. Simulation results assess the effect of different system parameters on the ASR performance as well as the effectiveness of the proposed deep learning solution in large-scale cases.
In this paper, a joint relay selection and power allocation (JRP) scheme is proposed to enhance the physical layer security of a cooperative network, where a multiple antennas source communicates with a single-antenna destination in the presence of untrusted relays and passive eavesdroppers (Eves). The objective is to protect the data confidentially while concurrently relying on the untrusted relays as potential Eves to improve both the security and reliability of the network. To realize this objective, we consider cooperative jamming performed by the destination while the JRP scheme is implemented. With the aim of maximizing the instantaneous secrecy rate, we derive a new closed-form solution for the optimal power allocation and propose a simple relay selection criterion under two scenarios of non-colluding Eves (NCE) and colluding Eves (CE). For the proposed scheme, a new closed-form expression is derived for the ergodic secrecy rate (ESR) and the secrecy outage probability as security metrics, and a new closed-form expression is presented for the average symbol error rate as a reliability measure over Rayleigh fading channels. We further explicitly characterize the high signal-to-noise ratio slope and power offset of the ESR to highlight the impacts of system parameters on the ESR. In addition, we examine the diversity order of the proposed scheme to reveal the achievable secrecy performance advantage. Finally, the secrecy and reliability diversity-multiplexing tradeoff of the optimized network are provided. Numerical results highlight that the ESR performance of the proposed JRP scheme for NCE and CE cases is increased with respect to the number of untrustworthy relays.
This paper investigates the physical-layer security of a multiuser peer-to-peer (MUP2P) relay network for amplify-and-forward (AF) protocol, where a secure user and other unclassified users coexist with a multi-antenna eavesdropper and the eavesdropper can wiretap the confidential information in both two cooperative phases. Our goal is to optimize the transmit power of the source and the beamforming weights of the relays jointly for secrecy rate maximization subject to the minimum signal-to-interference-noise-ratio (SINR) constraint at each user, and the individual and total power constraints. Mathematically, the optimization problem is non-linear and non-convex, which does not facilitate an efficient resource allocation algorithm design. As an alternative, a null space beamforming scheme is adopted at the relays for simplifying the joint optimization and eliminating the confidential information leakage in the second cooperative phase, where the relay beamforming vector lies in the null space of the equivalent channel of the relay to eavesdropper links. Although the null space beamforming scheme simplifies the design of resource allocation algorithm, the considered problem is still non-convex and obtaining the global optimum is very difficult, if not impossible. Employing a sequential parametric convex approximation (SPCA) method, we propose an iterative algorithm to obtain an efficient solution of the non-convex problem. Besides, the proposed joint design algorithm requires a feasible starting point, we also propose a low complexity feasible initial points searching algorithm. Simulations demonstrate the validity of the proposed strategy.
By taking a variety of realistic hardware imperfections into consideration, we propose an optimal power allocation (OPA) strategy to maximize the instantaneous secrecy rate of a cooperative wireless network comprised of a source, a destination, and an untrusted amplify-and-forward relay. We assume that either the source or the destination is equipped with a large-scale multiple antennas' system, while the rest are equipped with a single antenna. To prevent the untrusted relay from intercepting the source message, the destination sends an intended jamming noise to the relay, which is referred to as destination-based cooperative jamming. Given this system model, novel closed-form expressions are presented in the high signal-to-noise ratio regime for the ergodic secrecy rate and the secrecy outage probability. We further improve the secrecy performance of the system by optimizing the associated hardware design. The results reveal that by beneficially distributing the tolerable hardware imperfections across the transmission and reception radio-frequency front ends of each node, the system's secrecy rate may be improved. The engineering insight is that equally sharing the total imperfections at the relay between the transmitter and the receiver provides the best secrecy performance. Numerical results illustrate that the proposed OPA together with the most appropriate hardware design significantly increases the secrecy rate.
Securing the wireless transmissions in the physical layer is a new perspective of security. In a wireless relay system, cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security in the presence of passive eavesdroppers. However, in most works these two techniques are used in phase II of the cooperative transmission, which leaves the phase I out of protection. In this paper, we propose a joint cooperative beamforming and jamming scheme to enhance the security of a cooperative relay network, where a part of intermediate nodes adopt distributed beamforming while others jam the eavesdropper, simultaneously, such that both phases are secured. Since the instantaneous channel state information (CSI) of the eavesdropper may not be known, we propose a cooperative artificial noise transmission based secrecy strategy, subjected to the individual power constraint of each node. The beamformer weights and power allocation can be obtained by solving a second-order convex cone programming (SOCP) together with a linear programming problem. Simulations show the joint scheme greatly improves the security.