Secrecy Rate of the Amplify-and-Forward Relay Wire-Tap Channel in Rayleigh Fading

Author(s):  
Cuong Dang ◽  
Leonardo J. Rodríguez ◽  
Duc-Anh Le ◽  
Forrest Sheng Bao ◽  
Nghi H. Tran
2019 ◽  
Vol 2019 ◽  
pp. 1-9 ◽  
Author(s):  
Feng Zhou ◽  
Rugang Wang ◽  
Jiahong Bian

We consider a secrecy dual-hop amplify-and-forward (AF) untrusted relay network, where the relay is willing to forward the signal to the destination while acting as a potential eavesdropper. Assuming that all these nodes are equipped with multiple antennas, we propose a joint destination aided cooperative jamming and precoding at both the source and the relay scheme, with the objective to maximize the worst case secrecy rate. The formulated problem is highly non-convex due to the maximization of the difference of several logarithmic determinant (log-det) functions in the CSI uncertainty region. To handle this challenge, we propose to linearize these log-det terms. After linearization, we tackle the CSI uncertainty based on epigraph reformulation and the sign-definiteness lemma. Finally, an alternating optimization (AO) algorithm is proposed to solve the reformulated problem. Numerical results are provided to demonstrate the performance of the proposed scheme.


2014 ◽  
Vol 543-547 ◽  
pp. 2243-2248
Author(s):  
Min Li ◽  
Hong Zhou ◽  
Qin Fei Huang

The outage probability (OP) of dual-hop fixed-gain amplify-and-forward (AF) relay over Rayleigh fading channels is analyzed when the feedback delay, the estimation error and the multiple co-channel interferences (CCI) are all present. A closed-form expression for the OP is derived and validated by Monte Carlo simulations with several scenarios considered, also the impacts of feedback delay, estimation error and CCI have been shown in the numerical results.


Author(s):  
Cuong Dang ◽  
Leonardo J. Rodr´ıguez ◽  
Nghi H. Tran ◽  
Forrest Sheng Bao ◽  
Shivakumar Sastry

In this research work, we investigate the secrecy rate and optimal power allocation schemes for a half-duplex (HD) wire-tap Rayleigh fading channel in which a source wishes to communicate securely to a destination in the presence of an eavesdropper and under the aid of an amplify-and-forward (AF) relay. The secrecy capacity and the corresponding optimal power allocation schemes are examined under both individual and joint power constraints. Due to the absence of an insightful expression of the secrecy rate for a given power allocation scheme, determining such secrecy capacity is challenging. To overcome this issue, we first propose a novel method to calculate the expectation of an exponentially distributed random variable using the exponential integral function. By exploiting this calculation, we then establish the average secrecy rate of the considered AF relay channel in closed-form. By examining the quasi-concavity of the optimal power allocation problem, it is then concluded that the problem is quasi-concave. As such, the globally optimal solution exists and is unique for both individual and joint power constraints. A simple root finding method then can be applied into the derived close-formed formula to approximately calculate the optimal power allocation scheme to achieve the secrecy capacity. Numerical results are then provided to confirm the accuracy of the derived formula and the optimality of the proposed power allocation.


Author(s):  
Vo Nguyen Quoc Bao ◽  
Vu Van San

In this paper, we propose a novel derivation approach to obtain the exact closed form expression of ergodic capacity for cognitive underlay amplify-and-forward (AF) relay networks over Rayleigh fading channels. Simulation results are performed to verify the analysis results. Numerical results are provided to compare the system performance of cognitive underlay amplify-and-forward relay networks under both cases of AF and decode-and-forward (DF) confirming that the system with DF provides better performance as compared with that with AF. DOI: 10.32913/rd-ict.vol3.no14.563


Sign in / Sign up

Export Citation Format

Share Document