TY - GEN
T1 - The Generalized Secretary Problem Algorithm for Secrecy-Achieving Relay Selection
T2 - 2023 International Balkan Conference on Communications and Networking, BalkanCom 2023
AU - Illi, Elmehdi
AU - Qaraqe, Marwa
AU - Bouanani, Faissal El
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - In this work, a low-complexity generalized secretary problem (GSP) algorithm-based multi-relay selection scheme is proposed for enhancing the secrecy level of delay-sensitive communications. In detail, a number (i.e., K) of relays are suboptimally selected among a total of N ones in a dual-hop multi-relay wireless communication system to perform cooperative diversity. The signals reaching the destination from such selected relays are combined through the maximal-ratio combining technique under the presence of multiple eavesdroppers aiming to intercept the signals broadcasted by the selected relays. A novel analytical framework is derived, illustrating the probability of optimal selection using the proposed GSP-based approach. Then, the GSP's algorithm performance in terms of security and complexity is evaluated and compared against the well-known optimal generalized selection combining scheme.
AB - In this work, a low-complexity generalized secretary problem (GSP) algorithm-based multi-relay selection scheme is proposed for enhancing the secrecy level of delay-sensitive communications. In detail, a number (i.e., K) of relays are suboptimally selected among a total of N ones in a dual-hop multi-relay wireless communication system to perform cooperative diversity. The signals reaching the destination from such selected relays are combined through the maximal-ratio combining technique under the presence of multiple eavesdroppers aiming to intercept the signals broadcasted by the selected relays. A novel analytical framework is derived, illustrating the probability of optimal selection using the proposed GSP-based approach. Then, the GSP's algorithm performance in terms of security and complexity is evaluated and compared against the well-known optimal generalized selection combining scheme.
KW - Generalized secretary problem
KW - multi-relay selection
KW - physical layer security
UR - http://www.scopus.com/inward/record.url?scp=85165643163&partnerID=8YFLogxK
U2 - 10.1109/BalkanCom58402.2023.10167965
DO - 10.1109/BalkanCom58402.2023.10167965
M3 - Conference contribution
AN - SCOPUS:85165643163
T3 - 2023 International Balkan Conference on Communications and Networking, BalkanCom 2023
BT - 2023 International Balkan Conference on Communications and Networking, BalkanCom 2023
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 5 June 2023 through 8 June 2023
ER -