Results 1 - 10
of
19
Cooperative jamming for secure communications in MIMO relay networks
- IEEE TRANS. SIGNAL PROCESS
, 2011
"... Secure communications can be impeded by eaves-droppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally inactive nodes in the relay net-w ..."
Abstract
-
Cited by 30 (12 self)
- Add to MetaCart
Secure communications can be impeded by eaves-droppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally inactive nodes in the relay net-work can be used as cooperative jamming sources to confuse the eavesdropper. Linear precoding schemes are investigated for two scenarios where single or multiple data streams are transmitted via a decode-and-forward (DF) relay, under the assumption that global channel state information (CSI) is available. For the case of single data stream transmission, we derive closed-form jamming beamformers and the corresponding optimal power allocation. Generalized singular value decomposition (GSVD)-based secure relaying schemes are proposed for the transmission of multiple data streams. The optimal power allocation is found for the GSVD relaying scheme via geometric programming. Based on this result, a GSVD-based cooperative jamming scheme is proposed that shows significant improvement in terms of secrecy rate com-pared to the approach without jamming. Furthermore, the case involving an eavesdropper with unknown CSI is also investigated in this paper. Simulation results show that the secrecy rate is dramatically increased when inactive nodes in the relay network participate in cooperative jamming.
Spatially selective artificial-noise aided transmit optimization for MISO multi-eves secrecy rate maximization
- IEEE Trans. Signal Process
, 2013
"... ar ..."
(Show Context)
Secure Communication in Multiple Relay Networks Through Decode-and-Forward Strategies
"... Abstract: In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decodeand-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategi ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
(Show Context)
Abstract: In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decodeand-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategies that implement different versions of this scheme suited for cooperation with multiple relays. Our goal is to give an efficient cooperation paradigm based on the DF scheme to provide and improve secrecy in a multiple relay network. We first study the DF strategy for secrecy in a single relay network. We propose a suboptimal DF with zero forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF and obtain their achievable secrecy rates. The first strategy is a single hop strategy whereas the other two strategies are multiple hop strategies. In the first strategy, we show that it is possible to eliminate all the relays’ signals from the eavesdropper’s observation (full ZF), however, the achievable secrecy rate is limited by the worst sourcerelay channel. Our second strategy overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial ZF only. Our third strategy provides a reasonable compromise between the first two strategies. That is, in this strategy, full ZF is possible and the rate achieved does not suffer from the drawback of the first strategy. We conclude our study by a set of numerical results to illustrate the performance of each of the proposed strategies in terms of the achievable rates in different practical scenarios. Index Terms: Decode-and-forward (DF) scheme, information theoretic security, multiple hop strategies, relay networks, secrecy rate.
Power-Constrained Optimal Cooperative Jamming for Multiuser Broadcast Channel
"... Abstract—Optimal cooperative jamming (CJ) is studied for multiuser multiple-input multiple-output (MU-MIMO) broadcast channel to enhance the physical layer security with the help of a friendly jammer (FJ). We first derive a necessary and sufficient condition to achieve the asymptotically perfect sec ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
(Show Context)
Abstract—Optimal cooperative jamming (CJ) is studied for multiuser multiple-input multiple-output (MU-MIMO) broadcast channel to enhance the physical layer security with the help of a friendly jammer (FJ). We first derive a necessary and sufficient condition to achieve the asymptotically perfect security and propose an optimal CJ scheme to minimize the maximum signal-to-interference-plus-noise ratio (SINR) at the eavesdropper subject to a power constraint at the FJ. Then we derive an achievable lower bound of the eavesdropper’s SINR and propose an asymptotically optimal CJ scheme achieving the lower bound. Numerical results demonstrate that the proposed schemes are effective. Index Terms—Cooperative jamming, MU-MIMO BC. I.
Wireless physical layer security enhancement with buffer-aided relaying
- in Proc. 47th Asilomar Conf
, 2013
"... Abstract—We consider utilizing a buffer-aided relay to enhance security for two-hop half-duplex relay networks with an external eavesdropper. We propose a link selection scheme that adapts re-ception and transmission time slots based on the channel quality, while considering both the two-hop transmi ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Abstract—We consider utilizing a buffer-aided relay to enhance security for two-hop half-duplex relay networks with an external eavesdropper. We propose a link selection scheme that adapts re-ception and transmission time slots based on the channel quality, while considering both the two-hop transmission efficiency and the security. Closed-form expressions for the secrecy throughput and the secrecy outage probability (SOP) are derived, and the selection parameters are optimized to maximize the secrecy throughput or minimize the SOP. We also study two sub-optimal link selection schemes that only require a line search to solve the optimization problem. Numerical results show that buffer-aided relaying provides a significant improvement in security compared to conventional unbuffered relaying. I.
Exploring Relay Cooperation for Secure and Reliable Transmission in Two-Hop Wireless Networks
"... ar ..."
(Show Context)
Amplify-and-Forward Relay Beamforming for Secrecy with Cooperative Jamming and Imperfect CSI
"... Abstract—In this paper, we compute worst case secrecy rates in amplify-and-forward (AF) relay beamforming with cooper-ative jamming (CJ) in the presence of imperfect channel state information (CSI). A source-destination pair aided by M relays is considered. Number of eavesdroppers J can be more than ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper, we compute worst case secrecy rates in amplify-and-forward (AF) relay beamforming with cooper-ative jamming (CJ) in the presence of imperfect channel state information (CSI). A source-destination pair aided by M relays is considered. Number of eavesdroppers J can be more than the number of relays. Out of the M relays, k1 relays (1 ≤ k1 ≤ M) act as data relays and the remaining k2 = M − k1 relays act as jamming relays. Data relays aid the communication by relaying data in AF mode, and jamming relays cooperate by transmitting jamming signals (artificial noise). The jamming signals are created such that they degrade the eavesdroppers ’ channels but do not significantly affect the intended receiver’s channel, thereby improving secrecy rate. Imperfection in the CSI is modeled using a norm-bounded error model. We solve for the optimum (k1, k2) and the weights of data relays and jamming relays that maximize the secrecy rate subject to a total relay power constraint. We relax the rank-one constraint on the complex semi-definite data relays and jamming relays weight matrices and reformulate the optimization problem into a form that can be solved using convex semi-definite programming. Numerical results on the secrecy rate that illustrate the effect of cooperative jamming, imperfect CSI, and number of eavesdroppers are presented.
unknown title
"... 1Decode-and-forward plus cooperative jamming based cooperation for wireless physical layer security ..."
Abstract
- Add to MetaCart
1Decode-and-forward plus cooperative jamming based cooperation for wireless physical layer security
Opportunistic Relay and Jammer Cooperation Techniques for Physical-Layer Security in Buffer-aided Relay Networks
"... Abstract-In this paper, we investigate opportunistic relay and jammer cooperation schemes in multiple-input multiple-output (MIMO) buffer-aided relay networks. The network consists of one source, an arbitrary number of relay nodes, legitimate users and eavesdroppers, with the constraints of physica ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract-In this paper, we investigate opportunistic relay and jammer cooperation schemes in multiple-input multiple-output (MIMO) buffer-aided relay networks. The network consists of one source, an arbitrary number of relay nodes, legitimate users and eavesdroppers, with the constraints of physical layer security. We propose an algorithm to select a set of relay nodes to enhance the legitimate users' transmission and another set of relay nodes to perform jamming of the eavesdroppers. With Inter-Relay interference (IRI) taken into account, interference cancellation can be implemented to assist the transmission of the legitimate users. Secondly, IRI can also be used to further increase the level of harm of the jamming signal to the eavesdroppers. By exploiting the fact that the jamming signal can be stored at the relay nodes, we also propose a hybrid algorithm to set a signal-to-interference and noise ratio (SINR) threshold at the node to determine the type of signal stored at the relay node. With this separation, the signals with high SINR are delivered to the users as conventional relay systems and the low SINR performance signals are stored as potential jamming signals. Simulation results show that the proposed techniques obtain a significant improvement in secrecy rate over previously reported algorithms. Index Terms-Physical-layer security techniques, secrecy-rate analysis, relay selection, jamming techniques. I. INTRODUCTION In broadcast channels, secure transmission is difficult to achieve due to the broadcast nature of wireless communication systems. Traditional encryption techniques are implemented in the network layer. With complex algorithms, encryption keys which are nearly unbreakable are generated to ensure security while their costs are extremely high. To reduce the costs of encryption algorithms, researchers are investigating novel security techniques in the physical layer of wireless systems. Physical-layer security has been first illustrated in
Decode-and-Forward Based Strategies for Secrecy in Multiple-Relay Networks
"... Abstract—In this paper, we first study the Decode-and-Forward strategy for secrecy in a single-relay network. We propose a suboptimal Decode-and-Forward with Zero Forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose t ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—In this paper, we first study the Decode-and-Forward strategy for secrecy in a single-relay network. We propose a suboptimal Decode-and-Forward with Zero Forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF. The first strategy is a single-hop strategy in which all the relays decode the source message at the same time, then perform beamforming such that all the relays ’ signals are eliminated from the eavesdropper’s observation (full zero-forcing). We give the achievable rate by this strategy and derive the optimal power control policy. We show that, in this strategy, the relays which are far from the source create a bottleneck and limit the achievable rate. The second strategy is a multiple hop strategy that overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial zero-forcing only, assuming that all the relays are required to transmit fresh information in every transmission block. The third strategy is also a multiple hop strategy in which full zero-forcing is possible and the rate achieved does not suffer from the drawback of the first strategy. I.
