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.
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.
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.
Untrusted relays might decode the information while forwarding it and lead to threaten the security of the system in some realistic scenarios. The aim of the paper is to maximize the secrecy performance, and therefore on the ground of the cooperative jamming, we propose a novel power allocation-relay selection program in a multi-untrusted relay network where numerous antennas are equipped in the source and the destination simultaneously. Besides, we allow an optimal application of the power allocation factor and the proper selection of the relays, which makes the Ergodic Secrecy Rate (ESR) increased directly. Moreover, the closed-form expressions of the ESR in different scenarios to measure the secrecy performance are acquired. It can be known that the simulation results of the ESR are compliant with the theoretical, especially when Signal-to-Noise Ratio (SNR) is low. Apart from this, the ESR in theoretical values are tested to be approximately equal to the simulation. Compared to other relay selection strategies like partial selection strategy and the Max-Min (MM) selection strategy, the scheme proposed here can get the secrecy performance strengthen better.
In this paper, we investigate secure communication for an untrusted relay network, in which a source equipped with NS antennas communicates to M users with the help of an untrusted relay. To protect the data confidentially while concurrently relying on the untrusted relays, joint antenna and user selection scheme has been proposed with the aid of cooperative jamming. Furthermore, the impacts of both the number of antennas and the number of users on system performance are studied. Both the secrecy outage probability (SOP) and ergodic secrecy rate (ESR) are derived in closed form, and the secrecy diversity order of the considered networks is proved to be min(NS, M/2). Compared with the traditional single antenna and single source-destination scenario, both SOP and ESR can achieve a great improvement owing to the mutual effects of antenna diversity and user diversity. In addition, numerical results are conducted to demonstrate the validity of the proposed scheme.
In this paper, we examine the secrecy performance of two-way relaying between a large-scale multiple antenna base station (BS) and a single antenna mobile user (MU) in the presence of a multiple antenna external jammer. We consider the untrusted relaying scenario, where an amplify-and-forward relay is both a necessary helper and a potential eavesdropper to the BS and MU transmissions. With the aim of maximizing the instantaneous secrecy sum rate, we derive new closed-form solutions for the optimal power allocation (OPA) under the following three scenarios: 1) without jamming (WoJ) where the jammer is not activated; 2) friendly jamming (FJ) where the jamming signal is known a priori at the BS and MU; and 3) Gaussian noise jamming (GNJ) where the jamming signal is unknown at the BS and MU. Based on our OPA solutions, new closed-form expressions are derived for the ergodic secrecy sum rate (ESSR) with Rayleigh fading channels. Furthermore, we characterize the high signal-to-noise ratio slope and power offset of the ESSR to provide a fundamental comparison of the WoJ, FJ, and GNJ scenarios. Based on our analysis, we propose a simple relay selection criterion for the scenario when the BS and MU are assisted by multiple untrusted relays. Numerical examples are presented to demonstrate the impact of the jammer's location, number of antennas and the advantage of the proposed relay selection criterion on the secrecy performance. Our findings highlight that similar to the trusted relaying scenario, the ESSR of all three secure transmission scenarios improve as the number of untrusted relays increases. Moreover, we highlight an interesting insight that the OPA for the GNJ scenario results in the same ESSR performance as the OPA for the WoJ scenario.
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.
In this paper, we examine the physical layer security for cooperative wireless networks with multiple intermediate nodes, where the decode-and-forward protocol is considered. We propose a new joint relay and jammer selection (JRJS) scheme for protecting wireless communications against eavesdropping, where an intermediate node is selected as the relay for the sake of forwarding the source signal to the destination and meanwhile, the remaining intermediate nodes are employed to act as friendly jammers, which broadcast the artificial noise for disturbing the eavesdropper. We further investigate the power allocation among the source, relay and friendly jammers for maximizing the secrecy rate of proposed JRJS scheme, and derive a closed-form sub-optimal solution. Specifically, all the intermediate nodes, which successfully decode the source signal, are considered as relay candidates. For each candidate, we derive the sub-optimal closed-form power allocation solution and obtain the secrecy rate result of the corresponding JRJS scheme. Then, the candidate, which is capable of achieving the highest secrecy rate, is selected as the relay. Two assumptions about the channel state information (CSI), namely the full CSI (FCSI) and partial CSI (PCSI), are considered. Simulation results show that the proposed JRJS scheme outperforms the conventional pure relay selection, pure jamming, and generalized singular-value-decomposition-based beamforming schemes in terms of secrecy rate. Additionally, the proposed FCSI-based power allocation and PCSI-based power allocation schemes both achieve higher secrecy rates than the equal power allocation scheme.