Search

In this paper, we investigate two user scheduling algorithms (optimal user and threshold-based user scheduling algorithms) when we consider potential eavesdroppers in an uplink wiretap network. The optimal user scheduling (OUS) algorithm selects the user who has the maximum secrecy rate, based on channel feedback from all users. On the other hand, the threshold-based user scheduling (TUS) algorithm first considers the information leakage from the users to potential eavesdroppers and then selects the user among candidates who satisfy a threshold criterion on the information leakage. The OUS algorithm shows an optimal performance in terms of secrecy rate, but the TUS algorithm can achieve secrecy rate comparable with the OUS algorithm with reduced feedback overhead. For main contributions, we mathematically analyze the asymptotic behavior of the achievable secrecy rate of two scheduling algorithms when the signal-to-noise ratio (SNR) approaches to infinity. Further, we derive the approximated secrecy rate of the TUS algorithm and propose criteria to determine threshold values which maximize the achievable secrecy rate of the TUS algorithm. We verify our analytical results through simulations. We perform an extra simulation to investigate the effect of channel estimation error in the wiretap links on the average secrecy rate. Due to different scheduling principles in OUS and TUS schemes, the TUS scheme yields robustness against the channel estimation error in the wiretap links, compared with the OUS schemes.

In this paper, we consider user scheduling and power allocation techniques for downlinks where transmitted message must be kept confidential from all other unintended users and the number of users is larger than that of access point (AP) antennas. In order to maximize network secrecy rate with a limited number of antennas, the AP schedules a user who can achieve the largest secrecy rate and exploits multiple antennas for transmitting artificial noise to the unintended users. We derive the closed-form expressions of the optimal power allocation for the artificial noise and the average network secrecy rate through asymptotic analysis. The analysis results provide the insightful information on the behaviors of the user scheduling and the effect of system parameters on the network secrecy rate performance. It is shown that opportunistic scheduling with artificial noise transmission technique is more effective than the conventional precoding techniques for multiple confidential message transmissions in terms of network secrecy rate. Furthermore, we have also discussed a transmission strategy for the worst case scenarios where all unintended users are treated as colluding eavesdroppers. The simulations confirm the validity of the analysis results and provide additional information on the network performance in general cases. [ABSTRACT FROM AUTHOR]