A cooperative jamming protocol is studied in this paper and its ability to protect the communications of a pair of users in the presence of an eavesdropper. Communication of users is assisted by many helping interferers, assuming knowledge of channel state information. Closed form expressions are given for the optimal weights and power allocation maximizing the difference in the SNR between destination and eavesdropper; these are determined under transmit, reliability, and security constraints. Simulations show that noticeable improvements, of more than 30dB, may be attained in the SNR difference compared to the non-cooperative case.
A cooperative jamming protocol is studied in this paper and its ability to protect the communications of a pair of users in the presence of an eavesdropper. Communication of users is assisted by many helping interferers, assuming knowledge of channel state information. Closed form expressions are given for the optimal weights and power allocation maximizing the difference in the SNR between destination and eavesdropper; these are determined under transmit, reliability, and security constraints. Simulations show that noticeable improvements, of more than 30dB, may be attained in the SNR difference compared to the non-cooperative case.
Cooperative jamming is an approach that has been recently proposed for improving physical layer based security for wireless networks in the presence of an eavesdropper. While the source transmits its message to its destination, a relay node transmits a jamming signal to create interference at the eavesdropper. In this paper, a scenario in which the relay is equipped with multiple antennas is considered. A novel system design is proposed for determining the antenna weights and transmit power of source and relay, so that the system secrecy rate is maximized subject to a total transmit power constraint, or, the transmit power is minimized subject to a secrecy rate constraint. Since the optimal solutions to these problems are difficult to obtain, suboptimal closed-form solutions are proposed that introduce an additional constraint, i.e., the complete nulling of jamming signal at the destination.
The design of a cooperative protocol relying on both cooperative relaying and jamming in order to provide security at the physical layer of wireless communications is considered in this paper. We suppose that pair of nodes is assisted by a number of helpers in their communication, which either relay information or cause harmful interference to an eavesdropper, at both stages of the relaying protocol. Instead of maximizing the secrecy capacity, a signal-to-noise ratio based approach is taken. Solutions for the optimal weights used at each protocol and stage are sought along with the optimal power distribution. To solve this problem, tools from semi-definite and geometric programming are utilized, and an iterative algorithm is proposed. Simulations show noticeable gains (up to 50dB) compared to the non-cooperative case.
In a cooperative wireless network, we exploited node cooperation for achieving physical layer based security. In this paper, the case of one source-destination pair with the help of multiple cooperating nodes(relay nodes and jamming nodes) in the presence of one eavesdropper was considered to improve the performance of secure wireless communications. A novel cooperative scheme joint decode-and-forward and cooperative jamming(JDFCJ) was proposed. In this scheme, the relay nodes transmit a weighted version of the source signals and the jamming nodes just transmit a common weighted jamming signal to confound the eavesdropper. The novel system design is proposed to minimize the transmit power subject to a secrecy rate constraint. For JDFCJ, the optimal power allocation is obtained in closed-form in the condition of the complete nulling of jamming signals at the destination. The numerical evaluation of the transmit power results shows that the proposed scheme can significantly improve the performance of secure wireless communications, as compared to the DF scheme.
We consider secure wireless communications between a source and a destination aided by a multi-antenna relay, in the presence of an eavesdropper. In particular, two cooperation schemes of the relay are explored: cooperative relaying (CR) and cooperative jamming (CJ). We first investigate the transmit weight optimization of CR and CJ, for both cases with and without the eavesdropper's channel state information (ECSI). Then, for the case with ECSI, we derive the conditions under which CR achieves a higher secrecy rate than CJ; for the case without ECSI, we compare the secrecy rates of CR and CJ in high transmit power regimes. Building on this, we propose a novel hybrid scheme in which the relay utilizes both CR and CJ, and study the power allocation of the relay between CR and CJ for maximizing the secrecy rate.
A wireless network with one source, one destination, one eavesdropper, and multiple decode-and-forward 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, that particular relay cooperates with the source to jam the eavesdropper without creating interference at the destination. 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 secrecy rate of the proposed scheme scales with the total system powerP0and the number of available relaysKaccording to 1/2log2(1 +P0/8logK) - 1.6 bits/channel use . Although the proposed power allocation and relay selection assume global CSI available, the performance under imperfect relay CSI is also investigated. Also, the performance under distributed relay selection with limited feedback is demonstrated.
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.