TY - JOUR
T1 - On the Secrecy Performance of Generalized User Selection for Interference-Limited Multiuser Wireless Networks
AU - Al-Badarneh, Yazan H.
AU - Georghiades, Costas
AU - Radaydeh, Redha M.
AU - Alouini, Mohamed-Slim
N1 - KAUST Repository Item: Exported on 2021-02-23
Acknowledgements: This work was supported by the Qatar National Research Fund (a member of The Qatar Foundation) through the NPRP award [NPRP 8-648-2-273]. The statements made herein are solely the responsibility of the authors. The review of this paper was coordinated by Dr. Xianbin Wang.
PY - 2018/10/25
Y1 - 2018/10/25
N2 - We investigate the secrecy performance of a multiuser diversity scheme for an interference-limited wireless network with a base-station (BS), N legitimate users and an eavesdropper, in the presence of a single dominant interferer. Assuming interference dominates noise power at the eavesdropper and at each legitimate user's receiver, the BS transmits information to the legitimate user with the k-th best (highest) signal-to-interference ratio. We derive a closed-form expression for the secrecy outage probability for an arbitrary N and an asymptotic expression for a fixed k and large N. Furthermore, we derive a closed form asymptotic expression for the ergodic secrecy capacity of the k-th best user and show that it scales like $O\left(\log(N)\right)$ for a fixed k and large N.
AB - We investigate the secrecy performance of a multiuser diversity scheme for an interference-limited wireless network with a base-station (BS), N legitimate users and an eavesdropper, in the presence of a single dominant interferer. Assuming interference dominates noise power at the eavesdropper and at each legitimate user's receiver, the BS transmits information to the legitimate user with the k-th best (highest) signal-to-interference ratio. We derive a closed-form expression for the secrecy outage probability for an arbitrary N and an asymptotic expression for a fixed k and large N. Furthermore, we derive a closed form asymptotic expression for the ergodic secrecy capacity of the k-th best user and show that it scales like $O\left(\log(N)\right)$ for a fixed k and large N.
UR - http://hdl.handle.net/10754/629946
UR - https://ieeexplore.ieee.org/document/8509196
UR - http://www.scopus.com/inward/record.url?scp=85055710703&partnerID=8YFLogxK
U2 - 10.1109/TVT.2018.2878050
DO - 10.1109/TVT.2018.2878050
M3 - Article
AN - SCOPUS:85055710703
VL - 67
SP - 12442
EP - 12446
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
SN - 0018-9545
IS - 12
ER -