Delay and Energy Improvement for CSMA Networks Using Alternating Optimization

Author(s):  
Saja M.-K. Jawad ◽  
Mohannad H. Al-Ali ◽  
Abbas A. Jasim
2020 ◽  
Vol 17 (12) ◽  
pp. 139-155
Author(s):  
Tong Wang ◽  
Xiang Yang ◽  
Feng Deng ◽  
Lin Gao ◽  
Yufei Jiang ◽  
...  

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.


Sign in / Sign up

Export Citation Format

Share Document