In this paper, we investigate secure two-user AF relaying networks based on a destination assisted cooperative jamming (DACJ). We consider two sources, one destination, one eavesdropper and multiple amplify-and-forwards (AF) relays. In the first time slot, each source broadcasts the information signal to the relays. In order to protect the source message from being eavesdropped, the destination simultaneously transmits a jamming signal to each relay. The selected relay amplifies and forwards the combined signal to the destination and eavesdropper. We introduce reactive relay selection and power allocation to decrease the power consumption. Closed-form expressions for lower bound of ergodic secrecy capacity (ESC) are provided. Numerical results are presented to verify the exactness of the proposed mathematical analysis.
In this paper, we investigate secure two-user AF relaying networks based on a destination assisted cooperative jamming (DACJ). We consider two sources, one destination, one eavesdropper and multiple amplify-and-forwards (AF) relays. In the first time slot, each source broadcasts the information signal to the relays. In order to protect the source message from being eavesdropped, the destination simultaneously transmits a jamming signal to each relay. The selected relay amplifies and forwards the combined signal to the destination and eavesdropper. We introduce reactive relay selection and power allocation to decrease the power consumption. Closed-form expressions for lower bound of ergodic secrecy capacity (ESC) are provided. Numerical results are presented to verify the exactness of the proposed mathematical analysis.
In this paper, we propose a destination-assisted jamming and beamforming (DAJB) scheme for physical layer security in a one-way cooperative amplify-and-forward (AF) relay communication system. The system model consists of one source, one destination, one eavesdropper, and N relay nodes, with the individual power constraint of each relay node and the destination-assisted jamming node as well as unknown instantaneous channel state information (CSI) of the eavesdropper. Due to the half-duplex constraint of the relay nodes, there are two phases in our proposed DAJB scheme. In the first phase, the source node broadcasts information signal and all N relay nodes listen simultaneously. In the meantime, the destination node transmits the jamming signal to confuse the potential eavesdropper. In the second phase, all N relay nodes amplify and forward the received signals, covered by the artificial noise (AN), to the destination using the distributed beamforming technology. The optimal beamformer weights and power allocation are obtained by solving the second-order convex cone programming (SOCP) together with a linear programming (LP) problem. Furthermore, the performance of the DAJB scheme is analyzed in terms of the achievable secrecy rate. Compared with the scheme that selects a relay node as the jammer, we obtain larger power gain to achieve higher secrecy rates. Finally, the simulation results verify that the DAJB scheme greatly improves the secrecy rate of a one-way cooperative AF relay communication system.
In this paper, we investigate a secure semi-blind amplify-and-forward (AF) relaying system over Rayleigh fading channels. We consider a reactive relay selection where the relay is selected based on the highest instantaneous signal-to-noise ratio (SNR) of the second hop. We evaluate the ergodic secrecy capacity using source-assisted jamming (SAJ) and considering that relays act as eavesdroppers. In order to improve the secrecy performance, a direct link between the source and destination is considered. Numerical results are presented to verify the accuracy of the proposed mathematical analysis. Moreover, a comparison between secure semi-blind AF relaying system and secure channel-state-information (CSI)-assisted AF relaying system is performed to further prove the exactness of our analysis. The proposed secure semi-blind AF relaying system has a simpler mathematical analysis and a comparable secrecy performance as compared to secure CSI-assisted AF relaying system.
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.
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.
In this paper, we investigate secrecy communications in two-hop wireless relaying networks which consist of one source, one amplify-and-forward (AF) relay, one legitimate destination, and one eavesdropper. To prevent the eavesdropper from intercepting the source message, we make the destination send the intended noise to the AF relay during the first phase. This is referred to as cooperative jamming. According to the channel information at the destination, we address two types of jamming power allocation; (i) rate-optimal power allocation and (ii) outage-optimal power allocation. More specifically, without the instantaneous channel knowledge for the eavesdropper side, the outage probability of the secrecy rate is minimized with respect to the intended noise power level. We show that the outage-optimal allocation gives almost the same outage probability as the rateoptimal one. In addition, the jamming power consumption can be significantly reduced compared to the fixed and rate-optimal power allocation methods.
In this paper, we investigate secure communications in two-hop wireless relaying networks with one eavesdropper. To prevent the eavesdropper from intercepting the source message, the destination sends an intended jamming noise to the relay, which is referred to as cooperative jamming. This jamming noise helps protecting the source message from being captured reliably at the eavesdropper, while the destination cancels its self-intended noise. According to the channel information available at the destination, we derive three jamming power allocation strategies to minimize the outage probability of the secrecy rate. In addition, we derive analytic results quantifying the jamming power consumption of the proposed allocation methods.