This paper addresses the physical layer security of a two-hop decode-and-forward (DF) wireless relay network in the presence of several eavesdroppers. The wiretap channel model consists of a source, several eavesdroppers, couples of trusted relays and a destination. For this DF based cooperative relay scheme, the relays use different code words independent of the source code words to transmit a weighted version of the recoded messages as with the source messages to the legitimate receiver and jam the eavesdropper. We fix the transmit power of the source ( Ps ) to obtain the weights for secrecy rate maximization, assuming that global channel state information (CSI) is available. The maximization problem can be made to a generalized eigenvector problem, and it is easy to obtain the corresponding eigenvector that is the optimal relay weight vector by using the matrix computations. The closed-form optimal solution is derived for the relay weights that maximize the achievable secrecy rate.
This paper addresses the physical layer security of a two-hop decode-and-forward (DF) wireless relay network in the presence of several eavesdroppers. The wiretap channel model consists of a source, several eavesdroppers, couples of trusted relays and a destination. For this DF based cooperative relay scheme, the relays use different code words independent of the source code words to transmit a weighted version of the recoded messages as with the source messages to the legitimate receiver and jam the eavesdropper. We fix the transmit power of the source ( Ps ) to obtain the weights for secrecy rate maximization, assuming that global channel state information (CSI) is available. The maximization problem can be made to a generalized eigenvector problem, and it is easy to obtain the corresponding eigenvector that is the optimal relay weight vector by using the matrix computations. The closed-form optimal solution is derived for the relay weights that maximize the achievable secrecy rate.
In this paper, we consider secure communications of one source-destination pair in wireless multi-hop decode-and-forward (DF) relay networks. In the presence of an eavesdropper, we derive an optimal power allocation strategy to maximize achievable secrecy rates under an overall transmit power constraint assuming that a single relay is located at each individual hop. We demonstrate that the optimal power allocation is obtained when the overall power constraint and the DF-relaying constraints necessary to guarantee that each DF relay correctly decodes the information signals hold with equality, which rely on channel conditions between the source, relays, and destination. The channel conditions for the eavesdropper are shown to only influence relays that may be inactive for secrecy rate maximization. We also consider multiple cooperative relays at each hop to perform cooperative beamforming in the presence of multiple eavesdroppers. To improve the secrecy rate in multi-hop relay networks, which include more than two hops, we propose an iterative cooperative beamformer design and transmit power allocation scheme with relay selection. Numerical results are presented to investigate the secrecy capacity obtained by the optimal power allocation in multi-hop DF relay networks and to confirm the secrecy rate enhancement of the proposed cooperative beamforming scheme.
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.
Relying on physical layer security is an attractive alternative of utilizing cryptographic algorithms at upper layers of protocol stack for secure communications. In this paper, we consider a two-hop wireless relay network in the presence of an eavesdropper. Our scenario of interest spans over a four-node network model including a source, a destination, a trusted relay, and an untrusted eavesdropper in which the relay forwards the source message in a decode-and-forward (DF) fashion. The source and relay are allowed to use some of their available power to transmit jamming signals in order to create interference at the eavesdropper. The relay and destination are assumed to have the knowledge of the jamming signals. An important question is how to allocate the transmission power of the message signal and that of the jamming signal. First, we propose an optimal power allocation solution in which the knowledge of global channel state information (CSI) is required. To facilitate practical system design, two simple yet sub-optimal power allocation solutions are proposed which do not rely on eavesdropper's channels. For the purpose of performance comparisons, power allocation problems for two benchmark schemes without jamming are also analyzed.
We consider a cooperative wireless network in the presence of one or more eavesdroppers, and exploit node cooperation for achieving physical (PHY) layer based security. Two different cooperation schemes are considered. In the first scheme, cooperating nodes retransmit a weighted version of the source signal in a decode-and-forward (DF) fashion. In the second scheme, referred to as cooperative jamming (CJ), while the source is transmitting, cooperating nodes transmit weighted noise to confound the eavesdropper. We investigate two objectives: i) maximization of the achievable secrecy rate subject to a total power constraint and ii) minimization of the total power transmit power under a secrecy rate constraint. For the first design objective, we obtain the exact solution for the DF scheme for the case of a single or multiple eavasdroppers, while for the CJ scheme with a single eavesdropper we reduce the multivariate problem to a problem of one variable. For the second design objective, existing work introduces additional constraints in order to reduce the degree of difficulty, thus resulting in suboptimal solutions. Our work raises those constraints, and obtains either an analytical solution for the DF scheme with a single eavesdropper, or reduces the multivariate problem to a problem of one variable for the CJ scheme with a single eavesdropper. Numerical results are presented to illustrate the proposed results and compare them to existing work.
We investigate the problem of optimizing the secrecy rate of a link between a single source and a single destination in the presence of multiple relays and multiple eavesdroppers. Multiple relays assist the source by either retransmitting a weighted version of the source signal in a decode-and-forward (DF) fashion, or by performing cooperative jamming (CJ) i.e., transmitting weighted noise in order to confound the eavesdropper. In each protocol, the relay weights are designed to maximize the secrecy rate subject to a total power constraint. For the case of a single eavesdropper we obtain expressions for the optimal weights under both protocols in closed form, or propose the algorithms to research for the solution. For the DF protocol with multiple eavesdroppers we propose an algorithm to search for the solution. Numerical results illustrate that cooperation can significantly improve the system performance as compared to direct transmission.
A wireless network with one source, one destination, one eavesdropper and multiple decode-and-forward (DF) relays is considered. A two-slot cooperative relaying scheme is proposed that targets at maximizing the secrecy rate. In the first slot, the source transmits the information bearing signal, and at the same time, it cooperates with the destination in jamming the eavesdropper without creating interference at the relay. In the second slot, one optimally selected relay retransmits the decoded source signal, and at the same time, it cooperates with the source to jam the eavesdropper without creating interference at the destination. For the beamforming, no eavesdropper channel information is required. Optimal relay selection and also optimal power allocation among the first/second slot data signal and jamming noise are proposed. It is shown that the system secrecy rate of the proposed scheme scales with the total system power, P0and the number of available relays, K, according to log2(1 + P0/8 log K) - 1.6252bps.