This letter investigates a novel two-stage cooperative scheme to secure the communication system with one source, one destination and multiple helpers. Herein, the source mixes the confidential messages with the interferences transmitted by the helpers and destination. Since the helpers and destination serve to suppress interferences, the destination can acquire an interference-free signal, however the eavesdropper is still confused. This scheme can achieve positive secrecy rate even when the eavesdropper's channel is much better than the legitimate link, and only requires local channel state information (CSI) and a few parameters of the main link. An efficient sub-optimal algorithm for the majorization of system parameters is proposed to avoid global search and the practical case without eavesdropper's CSI is also considered. Simulation results demonstrate the effectiveness of the proposed scheme and algorithm.
This letter investigates a novel two-stage cooperative scheme to secure the communication system with one source, one destination and multiple helpers. Herein, the source mixes the confidential messages with the interferences transmitted by the helpers and destination. Since the helpers and destination serve to suppress interferences, the destination can acquire an interference-free signal, however the eavesdropper is still confused. This scheme can achieve positive secrecy rate even when the eavesdropper's channel is much better than the legitimate link, and only requires local channel state information (CSI) and a few parameters of the main link. An efficient sub-optimal algorithm for the majorization of system parameters is proposed to avoid global search and the practical case without eavesdropper's CSI is also considered. Simulation results demonstrate the effectiveness of the proposed scheme and algorithm.
We consider a Gaussian wiretap channel model with a single-antenna source, destination and eavesdropper. The communication is assisted by multiple multiantenna helpers that transmit noise to confound the eavesdropper. First, we consider a nulling scheme, in which each helper independently transmits noise, designed to maximize the system secrecy rate while creating no interference to the destination. In this scheme, each helper requires only local relay-destination channel state information (CSI). When global CSI is available at the relays, the nulling scheme is not optimal. The optimal jamming noise structure is also provided under global CSI. Interestingly, it is shown both analytically and via simulations that, despite its reduced CSI requirements, the nulling scheme may have secrecy rate performance that is very close to the optimal one. The probability of outage of the nulling scheme is provided in closed form based on the statistics of the eavesdropper CSI.
1A wireless communication network is considered, consisting of a source, a destination and an eavesdropper, each equipped with a single antenna. The communication is assisted by multiple multi-antenna helpers, which independently transmit jamming noise to confound the eavesdropper. The optimal structure of the jamming noise that maximizes the secrecy rate is derived. A suboptimal solution that results in nulling at the legitimate receiver is also considered. Unlike the optimal solution, which requires global channel information, the suboptimal solution requires local channel information only, i.e., each helper needs to know only its own channel to the destination. Although the nulling solution results in lower secrecy rate as compared to the optimal solution, simulations show that the difference is rather small, with the inexpensive and easy to implement nulling scheme performing near optimal.
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.
This paper investigates cooperative security in wireless networks, where a source (Alice) intends to transmit a confidential message to a legitimate destination (Bob), with the help of a cooperative jammer (Charlie), coexisting with multiple passive eavesdroppers (Eves). In particular, by assuming knowledge of Bob's perfect channel state information (CSI) but only Eves’ statistical CSIs, secrecy beamforming with artificial noise (AN) is utilized for secure transmission, and cooperative jamming (CJ) is explored to further enhance secrecy. We first derive an accurate closed-form expression for the secrecy outage probability (SOP), and establish the condition under which positive secrecy rate is achievable. Then, we provide a secure transmit design for maximizing the SOP constrained secrecy rate. Moreover, based on a strict mathematical analysis, we characterize the impact of the main channel quality and the number of Eves on transmit design and secrecy performance. Specifically, optimal power allocation ratio between the information-bearing signal and the AN signal increases as the main channel quality improves, and decreases with the number of Eves. Numerical results confirm that our design achieves performance improvement in terms of both secrecy rate and secure energy efficiency, as compared to the approach without CJ.
We consider a physical layer security problem where there is a source, an external helper, a legitimate receiver, and an eavesdropper, each equipped with one antenna. We assume that an additional out-of-band link from the source to the helper is available to improve the transmission security rate. A two-stage cooperative scheme is proposed. The proposed scheme consists of an information sharing stage and a cooperative transmission stage. Specifically, in the information sharing stage the source informs the helper of the signal to be transmitted, while in the cooperative transmission stage the source and the helper cooperate to transmit the signal to the legitimate receiver. Under this framework, we determine the optimal weights associated with this scheme and examine the secrecy capacity of the helper-assisted wiretap channel. The optimal weight design problem is generally nonconvex. To deal with this issue, an algorithm involving a one-dimensional search is developed. On the other hand, an analytical lower bound on the secrecy capacity is derived. Based on this lower bound, we further analyze the sufficient and necessary condition to ensure a positive secrecy capacity and derive the maximal achievable secure degrees of freedom, which are shown to be exactly the same as those of the multi-input single-output (MISO) wiretap channel.
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.