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

详细信息    查看全文

• 关键词：Decode ; and ; forward ; Relay beamforming ; Physical layer security ; DC programming and DCA
• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：9622
• 期：1
• 页码：640-650
• 全文大小：487 KB
• 参考文献：1.Al-Shatri, A., Weber, T.: Achieving the maximum sum rate using DC programming in cellular networks. IEEE Trans. Sig. Process 60(3), 1331–1341 (2012)MathSciNet CrossRef
  2.Cheng, Y., Pesavento, M.: Joint optimization of source power allocation and distributed relay beamforming in multiuser peer-to-peer relay networks. IEEE Trans. Sig. Process. 60(6), 2962–2973 (2012)MathSciNet CrossRef
  3.Dong, L., Han, Z., Petropulu, A., Poor, H.: Improving wireless physical layer security via cooperating relays. IEEE Trans. Sig. Process 58(3), 1875–1888 (2010)MathSciNet CrossRef
  4.Ekrem, E., Ulukus, S.: Secrecy in cooperative relay broadcast channels. IEEE Trans. Inf. Theory 57(1), 137–155 (2011)MathSciNet CrossRef
  5.Fazeli-Dehkordy, S., ShahbazPanahi, S., Gazor, S.: Multiple peer-to-peer communications using a network of relays. IEEE Trans. Signal Process. 57(8), 3053–3062 (2009)MathSciNet CrossRef
  6.Goel, S., Negi, R.: Guaranteeing secrecy using artificial noise. IEEE Trans. Wireless Commun. 7(6), 2180–2189 (2008)CrossRef
  7.Havary-Nassab, V., ShahbazPanahi, S., Grami, A.: Joint receive-transmit beamforming for multi-antenna relaying schemes. IEEE Trans. Signal Process. 58(9), 4966–4972 (2010)MathSciNet CrossRef
  8.He, X., Yener, A.: Cooperative jamming: the tale of friendly interference for secrecy. In: Liu, R., Trappe, W. (eds.) Securing Wireless Communications at the Physical Layer, pp. 65–88. Spinger, Heidelberg (2010)
  9.Hero, A.: Secure space-time communication. IEEE Trans. Inf. Theory 49(12), 3235–3249 (2003)MathSciNet CrossRef MATH
  10.Jing, Y., Jafarkhani, H.: Network beamforming using relays with perfect channel information. IEEE Trans. Inf. Theory 55(6), 2499–2517 (2009)MathSciNet CrossRef
  11.Kha, H.H., Tuan, H.D., Nguyen, H.H.: Fast global optimal power allocation in wireless network by local DC programming. IEEE Trans. Wireless Commun. 11(2), 510–512 (2012)CrossRef
  12.Le Thi, H.A.: DC Programming and DCA. http://​www.​lita.​univ-lorraine.​fr/​~lethi/​
  13.Le Thi, H.A., Nguyen, M.C., Pham Dinh, T.: A DC Programming Approach for Finding Communities in Networks. Neural Comput. 26(12), 2827–2854 (2014)MathSciNet CrossRef
  14.Le Thi, H.A., Nguyen, M.C., Pham Dinh, T.: Self-organizing maps by difference of convex functions optimization. Data Min. Knowl. Disc. 28, 1336–1365 (2014)MathSciNet CrossRef
  15.Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23–46 (2005)MathSciNet CrossRef MATH
  16.Le Thi, H.A., Vo, X.T., Le, H.M.: DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244(1), 26–46 (2015)MathSciNet CrossRef
  17.Le Thi, H.A., Vo, X.T., Pham Dinh, T.: Feature selection for linear SVMs under uncertain data: Robust optimization based on difference of convex functions algorithms. Neural Netw. 59, 36–50 (2014)CrossRef MATH
  18.Li, J., Petropulu, A., Weber, S.: On cooperative relaying schemes for wireless physical layer security. IEEE Trans. Sig. Process 59(10), 4985–4997 (2011)MathSciNet CrossRef
  19.Munoz-Medina, O., Vidal, J., Agustin, A.: Linear transceiver design in nonregenerative relays with channel state information. IEEE Trans. Sig. Process. 55(6), 2593–2604 (2007)MathSciNet CrossRef
  20.Negi, R., Goel, S.: Secret communication using artificial noise. In: 2005 IEEE 62nd Vehicular Technology Conference, VTC-2005-Fall, vol. 3, pp. 1906–1910, September 2005
  21.Parada, P., Blahut, R.: Secrecy capacity of simo and slow fading channels. In: Proceedings of the International Symposium on Information Theory, ISIT 2005, pp. 2152–2155, September 2005
  22.Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Mathematica Vietnamica 22(1), 289–357 (1997)MathSciNet MATH
  23.Pham Dinh, T., Le Thi, H.A.: Optimization algorithms for solving the trustregion subproblem. SIAM J. Optim. 8, 476–505 (1998)MathSciNet CrossRef MATH
  24.Pham Dinh, T., Le Thi, H.A.: Recent advances in DC programming and DCA. In: Nguyen, N.-T., Le-Thi, H.A. (eds.) TCCI 2013. LNCS, vol. 8342, pp. 1–37. Springer, Heidelberg (2014)CrossRef
  25.Shafiee, S., Ulukus, S.: Achievable rates in gaussian miso channels with secrecy constraints. In: IEEE International Symposium on Information Theory, 2007, ISIT 2007, pp. 2466–2470, June 2007
  26.ShahbazPanahi, S., Dong, M.: Achievable rate region under joint distributed beamforming and power allocation for two-way relay networks. IEEE Trans. Wireless Commun. 11(11), 4026–4037 (2012)CrossRef
  27.Stanojev, I., Yener, A.: Improving secrecy rate via spectrum leasing for friendly jamming. IEEE Trans. Inf. Forensics Secur. 12(1), 134–145 (2013)
  28.Vucic, N., Schubert, M.: DC programming approach for resource allocation in wireless networks. In: IEEE, Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, pp. 380–386, May 2010
  29.Wyner, A.D.: The wire-tap channel. Bell Sys. Tech. J. 54, 1355–1387 (1975)MathSciNet CrossRef MATH
  30.Zhang, J., Gursoy, M.: Collaborative relay beamforming for secrecy. In: 2010 IEEE International Conference on Communications (ICC), pp. 1–5, May 2010
  31.Zhang, J., Gursoy, M.: Relay beamforming strategies for physical-layer security. In: 2010 44th Annual Conference on Information Sciences and Systems (CISS), pp. 1–6, March 2010
  
• 作者单位：Tran Thi Thuy (17)
  Nguyen Nhu Tuan (18)
  Le Thi Hoai An (19)
  Alain Gély (19)
  
  17. FPT University, Hoa Lac High Tech Park, Hanoi, Vietnam
  18. Department of Cryptography, Academy of Cryptography Technique, Hanoi, Vietnam
  19. Laboratory of Theoretical and Applied Computer Science (LITA) UFR MIM, University of Lorraine, Ile du Saulcy, 57045, Metz, France
  
• 丛书名：Intelligent Information and Database Systems
• ISBN：978-3-662-49390-8
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349

文摘

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.