Intelligent Physical Layer Secure Relay Selection for Wireless Cooperative Networks with Multiple Eavesdroppers

被引:10
作者
Kamboj, Anil Kumar [1 ]
Jindal, Poonam [1 ]
Verma, Pankaj [1 ]
机构
[1] Natl Inst Technol, Dept Elect & Commun Engn, Kurukshetra 136119, Haryana, India
关键词
Physical layer security; Relay selection; Cooperative communication; Q; learning; Wireless networks; TRANSMISSION; COMMUNICATION; SYSTEMS;
D O I
10.1007/s11277-021-08458-4
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
The modern and emerging wireless communication technologies are benefiting from relaying techniques, which is already adopted in long term evolution (LTE) Release 10. The relay technology has great potential to improve the communication distance and system capabilities. However, due to the use of short-range frequencies for communication and increasing user density, relay technology requires the integration of machine learning and physical layer security (PLS) to attain its full potential. Therefore, this paper presents the machine learning (ML) algorithms for relay selection (RS) to improve the physical layer security of a dual-hop non-regenerative wireless cooperative network. The secure RS is converted into a prediction and decision-making problem. To the best of our knowledge, this is the first attempt to study the secured RS as a prediction and decision-making problem. We propose two reinforcement-learning techniques, namely the physical layer secured Q-learning algorithm for RS (PQL-RS) and the modified physical layer secured Q-learning algorithm for RS (MPQL-RS) for different scenarios. Markov decision process (MDP) is used with the introduced algorithms to select a single relay from a group of relays and multiple eavesdroppers. RS without requiring the prior data and network model knowledge are the unique advantages of the proposed algorithms. The introduced algorithms are compared to the different RS schemes and simulation results show that the MPQL-RS can deliver the best performance and save the convergence time. Moreover, the secrecy performance of different modulation techniques is also analyzed for the proposed algorithms. It is shown that the secrecy of the system improves by 7% on average for every double in modulation order.
引用
收藏
页码:2449 / 2472
页数:24
相关论文
共 42 条
[1]   Opportunistic Relay Selection for Secrecy Enhancement in Cooperative Networks [J].
Al-Qahtani, Fawaz S. ;
Zhong, Caijun ;
Alnuweiri, Hussein M. .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2015, 63 (05) :1756-1770
[2]   Output-Threshold Multiple-Relay-Selection Scheme for Cooperative Wireless Networks [J].
Amarasuriya, Gayan ;
Ardakani, Masoud ;
Tellambura, Chintha .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2010, 59 (06) :3091-3097
[3]  
[Anonymous], 2010, SECRECY CAPACITY GAU
[4]   Comment on "Relay Selection for Secure Cooperative Networks with Jamming" [J].
Chen, Gaojie ;
Dwyer, Vincent ;
Krikidis, Ioannis ;
Thompson, John S. ;
McLaughlin, Steve ;
Chambers, Jonathon .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2012, 11 (06) :2351-2351
[5]  
Dan Wang, 2018, IEEE Communications Magazine, V56, P114, DOI 10.1109/MCOM.2018.1701310
[6]  
Dimas A, 2020, INT CONF ACOUST SPEE, P5030, DOI [10.1109/icassp40776.2020.9054173, 10.1109/ICASSP40776.2020.9054173]
[7]   On Relay Selection for Decode-and-Forward Relaying [J].
Fareed, Muhammad Mehboob ;
Uysal, Murat .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2009, 8 (07) :3341-3346
[8]   Classifications and Applications of Physical Layer Security Techniques for Confidentiality: A Comprehensive Survey [J].
Hamamreh, Jehad M. ;
Furqan, Haji M. ;
Arslan, Huseyin .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2019, 21 (02) :1773-1828
[9]   Relay selection Algorithm for wireless cooperative networks: a learning-based approach [J].
Jadoon, Muhammad Awais ;
Kim, Sunghwan .
IET COMMUNICATIONS, 2017, 11 (07) :1061-1066
[10]   A Comprehensive Survey on Cooperative Relaying and Jamming Strategies for Physical Layer Security [J].
Jameel, Furqan ;
Wyne, Shurjeel ;
Kaddoum, Georges ;
Trung Q Duong .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2019, 21 (03) :2734-2771