Power Optimization Algorithms for Secure Communication via Cooperative Jamming Schemes: A Comparative Study

International Journal of Electronics and Communication Engineering

© 2024 by SSRG - IJECE Journal

Volume 11 Issue 12

Year of Publication : 2024

Authors : Shemi Panayappilly Mohammed, M. V. Rajesh, Vishnu Vasudev

10.14445/23488549/IJECE-V11I12P106

How to Cite?

Shemi Panayappilly Mohammed, M. V. Rajesh, Vishnu Vasudev, "Power Optimization Algorithms for Secure Communication via Cooperative Jamming Schemes: A Comparative Study," SSRG International Journal of Electronics and Communication Engineering, vol. 11,  no. 12, pp. 56-70, 2024. Crossref, https://doi.org/10.14445/23488549/IJECE-V11I12P106

Abstract:

The ultimate objective of cooperative communication is to secure data transmitted from source to destination against eavesdropper attacks. The paper compares different power optimization algorithms for cooperative jamming schemes to improve the secrecy performance of a four-node Amplify and Forward (AF) relay network. The main focus of the work is on the investigation of Optimal Power Allocation (OPA) for maximizing the secrecy rate subject to a total power constraint using two cooperative jamming schemes, Source and Relay Based Jamming (SRBJ) and Source Based Jamming (SBJ). The secrecy performance of SBJ is evaluated for trusted and untrusted relaying scenarios. In the untrusted case, the situation in which an external eavesdropper and untrusted relay exist simultaneously is analyzed. The iterative algorithms such as the Nelder-Mead technique (N-M), the Broyden - Fletcher – Goldfarb - Shanno (BFGS) algorithm and the Conjugate-Gradient (CG) methods are used for power optimization and, consequently, for secrecy rate maximization. Both symmetric and asymmetric relay positions are subjected to the secrecy analysis. A comparison is conducted using the equal power Allocation (EPA) approach and the Exhaustive Search (ES) algorithm. The paper also studies the complexity of different algorithms and jamming methods based on the average number of iterations required for system convergence. It was found that the iterative algorithms provide better secrecy than the conventional methods. Experimental results reveal a trade-off between the iterative algorithms' convergence and complexity. The gradient-based BFGS and CG algorithms are less complex than the gradient-free N-M method. When assessing all jamming schemes, the N-M method is a good choice for convergence, whereas the BFGS is the best choice for lesser complexity.

Keywords:

Broyden – Fletcher - Goldfarb - Shanno method, Conjugate - Gradient method, Cooperative jamming, Nelder Mead method, Secrecy rate.

References:

[1] Raef Bassily et al., “Cooperative Security at the Physical Layer: A Summary of Recent Advances,” IEEE Signal Processing Magazine, vol. 30, no. 5, pp. 16-28, 2013.
[CrossRef] [Google Scholar] [Publisher Link]
[2] A. Bletsas et al., “A Simple Cooperative Diversity Method Based on Network Path Selection,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 3, pp. 659-672, 2006.
[CrossRef] [Google Scholar] [Publisher Link]
[3] Xu Chen et al., “Asymptotic Analysis of Opportunistic Relaying Based on the Max-Generalized-Mean Selection Criterion,” IEEE Transactions on Wireless Communication, vol. 10, no. 4, pp. 1050-1057, 2011.
[CrossRef] [Google Scholar] [Publisher Link]
[4] Yulong Zou et al., “Improving Physical Layer Security in Wireless Communications Using Diversity Techniques,” IEEE Network, vol. 29, no. 1, pp. 42-48, 2015.
[CrossRef] [Google Scholar] [Publisher Link]
[5] Ruoheng Liu, and Wade Trappe, Securing Wireless Communications at the Physical Layer, Springer, 2010.
[CrossRef] [Google Scholar] [Publisher Link]
[6] Amitav Mukherjee et al., “Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey,” IEEE Communications Surveys & Tutorials, vol. 16, no. 3, pp. 1550-1573, 2014.
[CrossRef] [Google Scholar] [Publisher Link]
[7] Aylin Yener, and Sennur Ulukus, “Wireless Physical-Layer Security: Lessons Learned From Information Theory,” Proceedings of the IEEE, vol. 103, no. 10, pp. 1814-1825, 2015.
[CrossRef] [Google Scholar] [Publisher Link]
[8] Zhifan Xu, and Melike Baykal-Gürsoy, “Power Allocation for Cooperative Jamming Against a Strategic Eavesdropper Over Parallel Channels,” IEEE Transactions on Information Forensics and Security, vol. 18, pp. 846-858, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[9] Ali Kuhestani, and Abbas Mohammadi, “Destination-Based Cooperative Jamming in Untrusted Amplify-and-Forward Relay Networks: Resource Allocation and Performance Study,” IET Communications, vol. 10, no. 1, pp. 17-23, 2016.
[CrossRef] [Google Scholar] [Publisher Link]
[10] Wei Wang, Kah Chan The, and Kwok Hung Li, “Relay Selection for Secure Successive AF Relaying Networks with Untrusted Nodes,” IEEE Transactions on Information Forensics and Security, vol. 11, no. 11, pp. 2466-2476, 2016.
[CrossRef] [Google Scholar] [Publisher Link]
[11] Yuandong Wu, and Yan Huo, “A Survey of Cooperative Jamming-Based Secure Transmission for Energy-Limited Systems,” Hindawi Wireless Communications and Mobile Computing, vol. 2021, no. 1, pp. 1-11, 2021.
[CrossRef] [Google Scholar] [Publisher Link]
[12] Lun Dong et al., “Improving Wireless Physical Layer Security via Cooperating Relays,” IEEE Transactions on Signal Processing, vol. 58, no. 3, pp. 1875-1888, 2010.
[CrossRef] [Google Scholar] [Publisher Link]
[13] Dong Wang et al., “A Survey of Optimization Approaches for Wireless Physical Layer Security,” IEEE Communications Surveys & Tutorials, vol. 21, no. 2, pp. 1878-1911, 2019.
[CrossRef] [Google Scholar] [Publisher Link]
[14] Zonghao Ma et al., “Relay Power Allocation for Security Enhancement in Three-Phase AF Two-Way Relaying Systems,” 2017 9th International Conference on Wireless Communications and Signal Processing, Nanjing, China, pp. 1-6, 2017.
[CrossRef] [Google Scholar] [Publisher Link]
[15] Wanying Guo et al., “Cooperative Communication Resource Allocation Strategies for 5G and Beyond Networks: A Review of Architecture, Challenges and Opportunities,” Journal of King Saud University - Computer and Information Sciences, vol. 34, no. 10, pp. 8054-8078, 2022.
[CrossRef] [Google Scholar] [Publisher Link]
[16] P.M. Shemi, M.G. Jibukumar, and M.A. Ali, “Nelder-Mead-Based Power Optimization for Secrecy Enhancement in Amplify-and-Forward Cooperative Relay Networks,” International Journal of Communication Systems, vol. 32, no. 11, 2019.
[CrossRef] [Google Scholar] [Publisher Link]
[17] Lu Lv et al., “Improving Physical Layer Security in Untrusted Relay Networks: Cooperative Jamming and Power Allocation,” IET Communications, vol. 11, no. 3, pp. 393-399, 2017.
[CrossRef] [Google Scholar] [Publisher Link]
[18] P.M. Shemi, M.G. Jibukumar, and M.A. Ali, “Enhancing Secrecy in Cooperative Networks via Power Optimized Source Based Jamming,” 2019 2nd IEEE Middle East and North Africa Communications Conference (MENACOMM), Manama, Bahrain, pp. 1-6, 2019.
[CrossRef] [Google Scholar] [Publisher Link]
[19] J.A. Nelder, and R. Mead, “A Simplex Method for Function Minimization,” The Computer Journal, vol. 7, no. 4, pp. 308-313, 1965.
[CrossRef] [Google Scholar] [Publisher Link]
[20] R. Fletcher, Practical Methods of Optimization, Wiley, pp. 1-464, 1987.
[Google Scholar] [Publisher Link]
[21] Terry Anthony Straeter, “On the Extension of the Davidon-Broyden Class of Rank One, Quasi-Newton Minimization Methods to an Infinite Dimensional Hilbert Space with Applications to Optimal Control Problems,” Thesis, North Carolina State University at Raleigh, 2011.
[Google Scholar] [Publisher Link]
[22] Ali Kuhestani, Abbas Mohammadi, and Mohammadali Mohammadi, “Joint Relay Selection and Power Allocation in Large-Scale MIMO Systems with Untrusted Relays and Passive Eavesdroppers,” IEEE Transactions on Information Forensics and Security, vol. 13, no. 2, pp. 341-355, 2018.
[CrossRef] [Google Scholar] [Publisher Link]
[23] John H. Mathews, and Kurtis D. Fink, Numerical Methods: Using Matlab, Pearson, pp. 1-680, 2004.
[Google Scholar] [Publisher Link]
[24] Qiu Hong Zhao et al., “A Restarted and Modified Simplex Search for Unconstrained Optimization,” Computers & Operations Research, vol. 36, no. 12, pp. 3263-3271, 2009.
[CrossRef] [Google Scholar] [Publisher Link]
[25] Jr. J.E. Dennis, and Robert B. Schnabel, Secant Methods for Unconstrained Minimization, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Englewood Cliffs, NJ: Prentice-Hall, pp. 194-215, 1983.
[CrossRef] [Google Scholar] [Publisher Link]
[26] Oleksandra Osadcha, and Zbigniew Marszaek, “Comparison of Steepest Descent Method and Conjugate Gradient Method,” CEUR Workshop Proceedings, SYSTEM 2017 - Proceedings of the Symposium for Young Scientists in Technology, Engineering and Mathematics, pp. 1-6, 2017.
[Google Scholar] [Publisher Link]
[27] Wenyu Sun, and Ya-Xiang Yuan, Optimization Theory and Methods: Nonlinear Programming, Springer US, pp. 1-687, 2006.
[Google Scholar] [Publisher Link]
[28] Jürg Nievergelt, “Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power,” SOFSEM 2000 - Theory and Practice of Informatics, pp. 18-35, 2002.
[CrossRef] [Google Scholar] [Publisher Link]
[29] Matthieu Bloch et al., “Wireless Information-Theoretic Security,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2515-2534, 2008.
[CrossRef] [Google Scholar] [Publisher Link]
[30] Mischa Dohler, and Yonghui Li, Cooperative Communications: Hardware, Channel and PHY, Wiley, pp. 1-464, 2010.
[Google Scholar] [Publisher Link]