Cooperative communication in wireless relay systems can improve the physical layer security, and the relay selection has great impacts on the security performances. In this paper the relay selection in Amplify-and-Forward (AF) cooperative networks is investigated. The system model constitutes of a source, an eavesdropper, a destination, and a number of intermediate nodes with secrecy constraints. The proposed optimal selection (OS) algorithm is based on the instantaneous channel state information (CSI) of two hops, jointly protects the target destination against eavesdropping and interference. To simplify the complexity of OS, the suboptimal selection (SS) algorithm is also presented, which is based on the instantaneous of the first hop and the statistical CSI of the second hop respectively. The secrecy capacity and secrecy outage probability of these two relay selection algorithms are analyzed. Simulation results of OS and SS validate our theoretical analysis and show enhancement in the secrecy rate over the direct transmission.
Cooperative communication in wireless relay systems can improve the physical layer security, and the relay selection has great impacts on the security performances. In this paper the relay selection in Amplify-and-Forward (AF) cooperative networks is investigated. The system model constitutes of a source, an eavesdropper, a destination, and a number of intermediate nodes with secrecy constraints. The proposed optimal selection (OS) algorithm is based on the instantaneous channel state information (CSI) of two hops, jointly protects the target destination against eavesdropping and interference. To simplify the complexity of OS, the suboptimal selection (SS) algorithm is also presented, which is based on the instantaneous of the first hop and the statistical CSI of the second hop respectively. The secrecy capacity and secrecy outage probability of these two relay selection algorithms are analyzed. Simulation results of OS and SS validate our theoretical analysis and show enhancement in the secrecy rate over the direct transmission.
In this paper, we exploit the potential benefits of machine learning in enhancing physical layer security in cooperative wireless networks. We focus on the case where multiple relays adopt amplify-and-forward (AF) relaying to forward information from the source to the destination. It is assumed that the global channel state information (CSI) of the legitimate links and wiretap links is available to the source. The optimal relay is selected to improve physical layer security against eavesdropping. By modeling the problem of the relay selection as a multi-class classification problem, a neural network (NN) based scheme is proposed to select the optimal relay which guarantees the perfect secrecy performance of the relay cooperative communication system. Compared with the conventional relay selection scheme, the simulation results show that our proposed scheme not only achieves almost the same secrecy performance, but also has advantage of relatively small feedback overhead. The work presented here provides insights into the new design of relay selection based on machine learning.
This paper investigates the secure communication in a two-hop cooperative wireless network, where a buffer-aided relay is utilized to forward data from the source to destination, and a passive eavesdropper attempts to intercept data transmission from both the source and relay. Depending on the availability of instantaneous channel state information of the source, two cases of transmission mechanisms, i.e., adaptive-rate transmission and fixed-rate transmission are considered. To enhance the security of the system, novel link selection policies are proposed for both cases to select source-to-relay, relay-to-destination, or no link transmission based on the channels qualities. Closed-form expressions are derived for the end-to-end secrecy outage probability (SOP), secrecy outage capacity (SOC), and exact secrecy throughput (EST), respectively. Furthermore, we prove the condition that EST reaches its maximum, and explore how to minimize the SOP and maximize the SOC by optimizing the link selection parameters. Finally, simulations are conducted to demonstrate the validity of our theoretical performance evaluation, and extensive numerical results are provided to illustrate the efficiency of the proposed link selection polices for the secure communication in two-hop cooperative networks.
We evaluate the upper bound, lower bound and an approximate expression for secrecy outage probability of a dual hop Amplify-and-forward (AF) relay system when the single cooperating relay among the relays is selected without the knowledge of eavesdropper's instantaneous channel state information (CSI). This situation arises when eavesdropper is not a legitimate node, or being a trusted node, it acts maliciously and does not share its instantaneous CSI. We also obtain the tighter bounds in high signal-to-noise ratio (SNR) of the source to relay links and in high SNR of the relay to destination links. We show that when the SNR of the source to relay links tends to zero, it becomes the bottle neck for secure communication, and the secrecy outage tends to 1. We show that the approximate expression follows the simulated outage closely and the outage decreases with an increase in the number of relays and increases with an increase in the required secrecy rate.
The Physical Layer Security (PLS) technology has been proved to be an effective way to reduce information leakage in wireless communication networks. This paper discusses the problem of secure transmission for Amplify-and-Forward (AF) cooperative network which contains both an external eavesdropper and some untrusted relays at the same time, where each relay acts as a helper of transmitting information and a potential eavesdropper. We adopt the technology of Cooperative Jamming (CJ), which yields a significant performance in terms of providing a better level of security against eavesdropping and improving the secure transmission performance of the system. First we discuss the security performance of this new system model, give the secrecy rate in theory and derive a tight lower bound of this secrecy rate. Then we propose a relay selection scheme, which avoids using the channel state information (CSI) of external eavesdropper, to transmit information. Afterward, we also discuss the problem of power allocation in order to maximize the secrecy rate.
We study a relay and user selection scheme to improve the secrecy performance of cooperative multi-user multiple amplify-and-forward (AF) relay network. Nevertheless, relay transmission is highly susceptible to eavesdropping since confidential information is broadcasted twice, i.e., by the source and the relay. In particular, we propose a cooperative jamming aided secure transmission through the relay path. Furthermore, with the presence of the direct path, a transmission mode selection scheme is elaborated in such a way to reduce the amount of information leaked to non-selected users in the system, who may overhear the source message as eavesdroppers. Specifically, the selected relay is only activated when it has better secrecy performance than the source. We study the impact of outdated channel state information (CSI) on the system by deriving a closed-form lower bound for the secrecy outage probability (SOP). By investigating the effect of the jamming power level and the correlation coefficients imbalance, a comparison reveals that the proposed scheme outperforms the fixed transmission modes and its signal-to-noise ratio based counterpart. It is shown that the secrecy outage probability can be decreased as the number of destinations grows unless the number of relays is small. Importantly, optimal relay location and jamming power allocation significantly enhance the secrecy performance.
Physical (PHY) layer security approaches for wireless communications can prevent eavesdropping without upper layer data encryption. However, they are hampered by wireless channel conditions: absent feedback, they are typically feasible only when the source-destination channel is better than the source-eavesdropper channel. Node cooperation is a means to overcome this challenge and improve the performance of secure wireless communications. This paper addresses secure communications of one source-destination pair with the help of multiple cooperating relays in the presence of one or more eavesdroppers. Three cooperative schemes are considered: decode-and-forward (DF), amplify-and-forward (AF), and cooperative jamming (CJ). For these schemes, the relays transmit a weighted version of a reencoded noise-free message signal (for DF), a received noisy source signal (for AF), or a common jamming signal (for CJ). Novel system designs are proposed, consisting of the determination of relay weights and the allocation of transmit power, that maximize the achievable secrecy rate subject to a transmit power constraint, or, minimize the transmit power subject to a secrecy rate constraint. For DF in the presence of one eavesdropper, closed-form optimal solutions are derived for the relay weights. For other problems, since the optimal relay weights are difficult to obtain, several criteria are considered leading to suboptimal but simple solutions, i.e., the complete nulling of the message signals at all eavesdroppers (for DF and AF), or the complete nulling of jamming signal at the destination (for CJ). Based on the designed relay weights, for DF in the presence of multiple eavesdroppers, and for CJ in the presence of one eavesdropper, the optimal power allocation is obtained in closed-form; in all other cases the optimal power allocation is obtained via iterative algorithms. Numerical evaluation of the obtained secrecy rate and transmit power results show that the proposed design can significantly improve the performance of secure wireless communications.