Results 1 -
7 of
7
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.
COOPERATIVE WIRELESS COMMUNICATIONS: THE IMPACT OF CHANNEL UNCERTAINTY AND CHANNEL UNCERTAINTY AND PHYSICAL-LAYER SECURITY CONSIDERATIONS
, 2011
"... In this thesis, cooperative wireless communication strategies are studied in the presence of channel uncertainty and physical-layer security considerations. Initially, achievable rates and resource allocation strategies for imperfectly-known fading relay channels are investigated. Amplify-and-forwar ..."
Abstract
- Add to MetaCart
(Show Context)
In this thesis, cooperative wireless communication strategies are studied in the presence of channel uncertainty and physical-layer security considerations. Initially, achievable rates and resource allocation strategies for imperfectly-known fading relay channels are investigated. Amplify-and-forward (AF) and decode-and-forward (DF) relaying schemes with different degrees of cooperation are considered. The corresponding achievable rate expressions are obtained and efficient resource allocation strategies are identified. Then, the analysis is extended to two-way decode-and-forward (DF) fading relay channels. In the second part of the thesis, the concentration is on wireless information-theoretic security. First, collaborative beamforming schemes for both DF and AF relaying are studied under secrecy constraints. The optimal selection of the beamforming vector is formulated
Secure Communication in Cooperative Network with Wireless Information and Power Transfer
"... This paper considers the secure communication issue in an amplify-and-forward (AF) relaying cooperative network, in which the energy harvesting relay is powered by radio-frequency (RF) signals from the source. Based on the two different energy harvesting strategies, i.e. power splitting-based relayi ..."
Abstract
- Add to MetaCart
(Show Context)
This paper considers the secure communication issue in an amplify-and-forward (AF) relaying cooperative network, in which the energy harvesting relay is powered by radio-frequency (RF) signals from the source. Based on the two different energy harvesting strategies, i.e. power splitting-based relaying (PSR) protocols and time switching-based relaying (TSR) protocols, we formulate the problem for maximizing the secrecy rate subject to the transmitted power constraint by taking into account the power splitting coefficient and time switching coefficient. We solve these problems by applying the semidefinite programming relaxation approach and 1-D optimization over the coefficients of energy harvesting protocols. The simulation results are presented to verify the effectiveness of these solutions proposed in this paper. I.
0 Optimal Power Allocation for Secrecy Fading Channels Under Spectrum-Sharing Constraints
"... ar ..."
(Show Context)
