On the multi-user diversity with secrecy in uplink wiretap networks

In this letter, we consider the uplink wiretap network which consists of a base station, N legitimate users, and several eavesdroppers. We propose a novel user scheduling algorithm based on a threshold, which achieves the optimal multi-user diversity gain, i.e., log log N. To the best of our knowledge, there has been no such result in uplink wiretap networks. In order to obtain good throughput performance in the network, the threshold value needs to be carefully chosen. Through extensive simulations, we observe that the proposed user scheduling outperforms the conventional scheduling algorithms and it approaches the throughput performance of the optimal user scheduling algorithm in various scenarios.