pith. sign in

arxiv: 1411.0220 · v1 · pith:LAJ2DES2new · submitted 2014-11-02 · 💻 cs.IT · math.IT

Secrecy Outage Probability Analysis of Multi-User Multi-Eavesdropper Wireless Systems

classification 💻 cs.IT math.IT
keywords schedulingmulti-useroutagesecrecyprobabilityround-robinproposedusers
0
0 comments X
read the original abstract

In this paper, we explore the physical-layer security of a multi-user wireless system that consists of multiple users intending to transmit to a base station (BS), while multiple eavesdroppers attempt to tap the user transmissions. We examine the employment of multi-user scheduling for improving the transmission security against eavesdropping and propose a multi-user scheduling scheme, which only requires the channel state information (CSI) of BS without the need of the passive eavesdroppers' CSI. We also consider the round-robin scheduling for comparison purposes. The closed-form secrecy outage probability expressions of the round-robin scheduling and proposed multi-user scheduling are derived over Rayleigh fading channels. Numerical results demonstrate that the proposed multi-user scheduling outperforms the round-robin scheduling in terms of the secrecy outage probability. As the number of users increases, the secrecy outage probability of round-robin scheduling keeps unchanged. By contrast, the secrecy outage performance of the proposed multi-user scheduling improves significantly with an increasing number of users.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.