DC Programming and DCA for Enhancing Physical Layer Security via Relay Beamforming Strategies

Beside of cryptography - the primary traditional methods for ensuring information security and confidentiality, the appearance of the physical layer security approach plays an important role for not only enabling the data transmission confidentially without relying on higher-layer encryption, but also enhancing confidentiality of the secret key distribution in cryptography itself. In this paper, we mention a technique used in physical layer security, this is relay beamforming strategy with Decode-and-Forward relaying technique. The optimization problems with the aim of maximizing the sum of secrecy rates subject to individual relay power constraints are formulated as a nonconvex problem. These problems can be rewritten as DC (difference of two convex functions) programs. We apply the standard DCA scheme to find solution to this problem. The main benefit of the proposed method is that it provides an optimal value for the system secrecy rate while the previous existing methods only give its upper bound.

[1]  T. P. Dinh,et al.  Convex analysis approach to d.c. programming: Theory, Algorithm and Applications , 1997 .

[2]  Shahram Shahbazpanahi,et al.  Achievable Rate Region under Joint Distributed Beamforming and Power Allocation for Two-Way Relay Networks , 2012, IEEE Transactions on Wireless Communications.

[3]  Mustafa Cenk Gursoy,et al.  Relay beamforming strategies for physical-layer security , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[4]  Le Thi Hoai An,et al.  The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems , 2005, Ann. Oper. Res..

[5]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[6]  Yong Cheng,et al.  Joint Optimization of Source Power Allocation and Distributed Relay Beamforming in Multiuser Peer-to-Peer Relay Networks , 2012, IEEE Transactions on Signal Processing.

[7]  Zhu Han,et al.  Improving Wireless Physical Layer Security via Cooperating Relays , 2010, IEEE Transactions on Signal Processing.

[8]  Ha H. Nguyen,et al.  Fast Global Optimal Power Allocation in Wireless Networks by Local D.C. Programming , 2012, IEEE Transactions on Wireless Communications.

[9]  Tobias Weber,et al.  Achieving the Maximum Sum Rate Using D.C. Programming in Cellular Networks , 2012, IEEE Transactions on Signal Processing.

[10]  Adrian Agustin,et al.  Linear Transceiver Design in Nonregenerative Relays With Channel State Information , 2007, IEEE Transactions on Signal Processing.

[11]  Rohit Negi,et al.  Guaranteeing Secrecy using Artificial Noise , 2008, IEEE Transactions on Wireless Communications.

[12]  Xiang He,et al.  Cooperative Jamming: The Tale of Friendly Interference for Secrecy , 2009 .

[13]  Nikola Vucic,et al.  DC programming approach for resource allocation in wireless networks , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[14]  Sennur Ulukus,et al.  Achievable Rates in Gaussian MISO Channels with Secrecy Constraints , 2007, 2007 IEEE International Symposium on Information Theory.

[15]  Aylin Yener,et al.  Improving Secrecy Rate via Spectrum Leasing for Friendly Jamming , 2013, IEEE Transactions on Wireless Communications.

[16]  Le Thi Hoai An,et al.  DC approximation approaches for sparse optimization , 2014, Eur. J. Oper. Res..

[17]  Alfred O. Hero,et al.  Secure space-time communication , 2003, IEEE Trans. Inf. Theory.

[18]  Steven P. Weber,et al.  On Cooperative Relaying Schemes for Wireless Physical Layer Security , 2010, IEEE Transactions on Signal Processing.

[19]  Sennur Ulukus,et al.  Secrecy in Cooperative Relay Broadcast Channels , 2011, IEEE Trans. Inf. Theory.

[20]  Yindi Jing,et al.  Network beamforming using relays with perfect channel information , 2009, IEEE Trans. Inf. Theory.

[21]  Le Thi Hoai An,et al.  Feature selection for linear SVMs under uncertain data: Robust optimization based on difference of convex functions algorithms , 2014, Neural Networks.

[22]  Le Thi Hoai An,et al.  A DC Programming Approach for Finding Communities in Networks , 2014, Neural Computation.

[23]  Mustafa Cenk Gursoy,et al.  Collaborative Relay Beamforming for Secrecy , 2010, 2010 IEEE International Conference on Communications.

[24]  Le Thi Hoai An,et al.  Recent Advances in DC Programming and DCA , 2013, Trans. Comput. Collect. Intell..

[25]  Le Thi Hoai An,et al.  Self-organizing maps by difference of convex functions optimization , 2014, Data Mining and Knowledge Discovery.

[26]  R. Negi,et al.  Secret communication using artificial noise , 2005, VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference, 2005..

[27]  Shahram Shahbazpanahi,et al.  Joint Receive-Transmit Beamforming for Multi-Antenna Relaying Schemes , 2010, IEEE Transactions on Signal Processing.

[28]  Le Thi Hoai An,et al.  A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem , 1998, SIAM J. Optim..

[29]  Richard E. Blahut,et al.  Secrecy capacity of SIMO and slow fading channels , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[30]  Saeed Gazor,et al.  Multiple Peer-to-Peer Communications Using a Network of Relays , 2009, IEEE Transactions on Signal Processing.