The four-terminal relay-eavesdropper channel with orthogonal receive components (i.e. the signals transmitted from the source and relay do not interfere each other) is studied in this paper. As the relay node merely repeats the received noisy signal with the conventional amplify-and-forward (AF) relaying strategy, AF is suboptimal. A piecewise linear AF (PLAF) relaying scheme is utilized to the channel model in this paper. Achievable secrecy rate with PLAF is derived and computed numerically. Numerical examples are given to show the performance improvement of PLAF compared with AF. Simulation results show that PLAF outperforms AF and achieves a higher secrecy rate than decode-and-forward (DF) in some certain cases but without complex encoding and decoding.
The four-terminal relay-eavesdropper channel with orthogonal receive components (i.e. the signals transmitted from the source and relay do not interfere each other) is studied in this paper. As the relay node merely repeats the received noisy signal with the conventional amplify-and-forward (AF) relaying strategy, AF is suboptimal. A piecewise linear AF (PLAF) relaying scheme is utilized to the channel model in this paper. Achievable secrecy rate with PLAF is derived and computed numerically. Numerical examples are given to show the performance improvement of PLAF compared with AF. Simulation results show that PLAF outperforms AF and achieves a higher secrecy rate than decode-and-forward (DF) in some certain cases but without complex encoding and decoding.
The problem of secure unicast communication over multihop wireless relay networks with directed links in the presence of an eavesdropper is considered. In the existing literature this problem has been considered in one or both of the following two scenarios: (A) relay nodes employ relaying schemes, such as Decode-and-Forward (DF), (B) the source communicates with the destination over a two-hop relay network. We argue that computationally complex relaying schemes such as DF render end-to-end performance characterization intractable, without providing any performance guarantee in general channel and network scenarios. Therefore, we consider one of the simplest relaying scheme: Amplify-and-Forward (AF) that allows us to provide guarantees on the optimal performance over a wide range of channel conditions. A node performing AF-relaying scales and forwards the signal received at its input. Further, with AF-relaying the end-to-end performance characterization problem remains tractable for much larger class of networks than those that can be considered with other relaying schemes. The key contribution of this work is twofold. We first provide the optimal vector of scaling factors that maximizes the achievable AF secrecy rate, no matter which relay the eavesdropper listens to. Further, we prove that in high-SNR regime, the optimal AF secrecy rate thus achieved is within a constant gap from the cutset upper bound on the secrecy capacity.
The secrecy capacity of relay channels with orthogonal components is studied in the presence of an additional passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the destination also receives transmissions from the relay on its channel. The eavesdropper can overhear either one or both of the orthogonal channels. Inner and outer bounds on the secrecy capacity are developed for both the discrete memoryless and the Gaussian channel models. For the discrete memoryless case, the secrecy capacity is shown to be achieved by a partial decode-and-forward (PDF) scheme when the eavesdropper can overhear only one of the two orthogonal channels. Two new outer bounds are presented for the Gaussian model using recent capacity results for a Gaussian multiantenna point-to-point channel with a multiantenna eavesdropper. The outer bounds are shown to be tight for two subclasses of channels. The first subclass is one in which the source and relay are clustered, and the eavesdropper receives signals only on the channel from the source and the relay to the destination, for which the PDF strategy is optimal. The second is a subclass in which the source does not transmit to the relay, for which a noise-forwarding strategy is optimal.
The secrecy capacity is developed for a class of relay channels with orthogonal components and a passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the destination also receives transmissions from the relay on its channel. The eavesdropper can overhear either one or both of the orthogonal channels. Inner and outer bounds on the secrecy capacity are developed for both the discrete memoryless and the Gaussian channel models. For the discrete memoryless case, the secrecy capacity is shown to be achieved by a partial decode-and-forward (PDF) scheme when the eavesdropper can overhear only one of the two orthogonal channels. Two new outer bounds are presented for the Gaussian model using recent capacity results for a Gaussian multi-antenna channel with a multi-antenna eavesdropper. The outer bounds are shown to be tight for two sub-classes of channels. The first sub-class is one in which the source and relay are clustered and the eavesdropper overhears on only one of the two channels for which the PDF strategy is optimal. The second is a sub-class in which the source does not transmit to the relay for which a noise-forwarding strategy is optimal.
In this paper, the security aspect of an amplify-and-forward relaying network with untrusted relay nodes is considered. The untrusted nodes can help to forward the received signal and they may also try to decode such information, which can be regarded as potential eavesdroppers (Eves). To deal with such a challenging issue, a successive relaying scheme is adopted, where the multi-antenna source transmits to two selected nodes alternately, and the conventional detrimental inter-relay interference is used to jam the untrusted nodes without external helpers. Considering different complexity requirements, several relay selection schemes are proposed, and the closed-form expressions of the lower bound of secrecy outage probability are derived accordingly. To obtain some insights for the network design, an asymptotic analysis is also given, which shows that the maximum secrecy diversity order of N-1 can be achieved, where N is the number of the untrusted relays. Moreover, the spectral efficiency is improved dramatically with the successive relaying scheme. Simulation results show that the proposed max-min scheme has almost the same performance as that of the optimal one, and the theoretical results match well with the simulation results.
We study the transmit design at relay nodes for secure amplify-and-forward (AF) networks. Two joint cooperative relaying and jamming schemes, namely Secrecy Rate Maximization Scheme and Null-Space Jamming Scheme, are proposed. In the first scheme, optimal relaying weight vector and optimal covariance matrix associated with the artificial noise (AN) are obtained, which involves doing a one-dimensional search and solving a sequence of semidefinite programs(SDPs). In the second scheme, which is suboptimal but computationally much cheaper, AN is designed to decrease the rate at the eavesdropper while the relaying weight vector is determined to increase the rate at the destination. In addition, Power Allocation based on secrecy rate maximization provides a balance between these two goals. Numerical results show that the proposed Secrecy Rate Maximization Scheme outperforms the existing cooperative relaying without jamming scheme. Especially, when the power is large enough, the secrecy rate achieved by the proposed schemes approaches the maximal achievable rate for the no-eavesdropper case.
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.