This paper investigates physical layer security with opportunistic scheduling in a downlink wireless network with multiple asymmetrically located legitimate users (LUs) and eavesdroppers. We employ the cumulative distribution function (CDF)-based scheduling policy to guarantee fairness among LUs in arbitrary fading channels while exploiting multiuser diversity. Under this scheduling framework, the closed-form expressions for the secrecy throughput and secrecy outage probability are derived, illustrating the interplay among the system parameters such as the channel statistics and the number of LUs and eavesdroppers. In order to investigate the exploited multiuser diversity gain, the normalized secrecy throughput, i.e., the secrecy throughput for a given LU normalized by the probability of it being selected, is analyzed and is proved to achieve a double-logarithmic growth when the number of LUs in the network increases to infinity. In addition, we derive the secrecy diversity order through an asymptotic analysis of intercept probability and prove that the secrecy diversity order is equal to the number of LUs in the system, implying that full diversity is achieved by the CDF-based scheduling.
This paper investigates physical layer security with opportunistic scheduling in a downlink wireless network with multiple asymmetrically located legitimate users (LUs) and eavesdroppers. We employ the cumulative distribution function (CDF)-based scheduling policy to guarantee fairness among LUs in arbitrary fading channels while exploiting multiuser diversity. Under this scheduling framework, the closed-form expressions for the secrecy throughput and secrecy outage probability are derived, illustrating the interplay among the system parameters such as the channel statistics and the number of LUs and eavesdroppers. In order to investigate the exploited multiuser diversity gain, the normalized secrecy throughput, i.e., the secrecy throughput for a given LU normalized by the probability of it being selected, is analyzed and is proved to achieve a double-logarithmic growth when the number of LUs in the network increases to infinity. In addition, we derive the secrecy diversity order through an asymptotic analysis of intercept probability and prove that the secrecy diversity order is equal to the number of LUs in the system, implying that full diversity is achieved by the CDF-based scheduling.
Opportunistic scheduling schemes are investigated for uplink wiretap channels with multiple asymmetrically located legitimate users (LUs) and eavesdroppers. To exploit multiuser diversity, the cumulative distribution function-based scheduling method is leveraged to schedule the transmissions of the LUs. Under this scheduling framework, the closed-form expressions of the secrecy outage probability and ergodic secrecy rate are derived, illustrating the interplay among the system parameters, such as the channel statistics and the number of LUs and eavesdroppers. Through the secrecy outage analysis of the proposed scheduling schemes, we observe that the secrecy throughput is not always maximized with a larger channel access ratio (CAR), and consequently, we design a CAR adjustment scheme to maximize the secrecy throughput while satisfying the required secrecy level. We also prove that under our proposed scheduling schemes, the secrecy diversity order of each LU is equal to the reciprocal of the LU's CAR, implying that full diversity order is achieved, and the ergodic secrecy rate of each LU normalized by its CAR achieves the optimal double-logarithmic growth when the number of LUs increases to infinity.
In this paper, we propose two opportunistic scheduling algorithms for uplink wiretap networks with multiple legitimate users (LUs) and eavesdroppers. Different from the existing works on scheduling algorithms with secrecy considerations, we focus on the practical scenario where LUs experience diverse path-loss to the base station (BS). Hence, both secrecy throughput and fairness among LUs are crucial design considerations. In the proposed scheduling algorithms, the feedback information generated by each LU is designed to reduce the probability that the LU is selected by the BS when the eavesdroppers overhear much information. It is proved that fairness among LUs can be achieved in arbitrary fading channels. In order to investigate the efficiency of our proposed scheduling algorithms, the normalized secrecy throughput, i.e., the secrecy throughput for a given LU normalized by the probability of it being selected, is analyzed and proved to achieve double-logarithmic growth when the number of LUs in the network increases to infinity.
In this paper, we consider a multiuser downlink wiretap network consisting of one base station (BS) equipped with AA antennas, NB single-antenna legitimate users, and NE single-antenna eavesdroppers over Nakagami-m fading channels. In particular, we introduce a joint secure transmission scheme that adopts transmit antenna selection at the BS and explores threshold-based selection diversity scheduling over legitimate users to achieve a good secrecy performance while maintaining low implementation complexity. More specifically, in an effort to quantify the secrecy performance of the considered system, two practical scenarios are investigated, i.e.: in Scenario I, the eavesdropper's channel state information (CSI) is unavailable at the BS, and in Scenario II, the eavesdropper's CSI is available at the BS. For Scenario I, novel exact closed-form expressions for the secrecy outage probability are derived, which are valid for general networks with an arbitrary number of legitimate users, antenna configurations, number of eavesdroppers, and the switched threshold. For Scenario II, we take into account the ergodic secrecy rate as the principle performance metric, and derive novel exact closed-form expressions for the ergodic secrecy rate. In addition, we also provide simple and asymptotic expressions for secrecy outage probability and ergodic secrecy rate under two distinct cases, i.e.: in Case I, the legitimate user is located close to the BS, and in Case II, both the legitimate user and eavesdropper are located close to the BS. Our important findings reveal that the secrecy diversity order is AAmA and the slope of secrecy rate is one under Case I, while the secrecy diversity order and the slope of secrecy rate collapse to zero under Case II, where the secrecy performance floor occurs. Finally, when the switched threshold is carefully selected, the considered scheduling scheme outperforms other well-known existing schemes in terms of the secrecy performance and complexity tradeoff.
We introduce an opportunistic scheduling to enhance the physical layer security with transmit antenna selection (TAS) in multiuser environment. We consider a wireless communication system composed of a single transmitter and multiple legitimate users in the presence of several eavesdroppers with each node having multiple antennas under quasi-static Rayleigh fading channel. The transmitter selects the best transmitting antenna and the best user to maximize signal-to-noise ratio (SNR) at the selected user. The user and eavesdropper can employ either selection combining (SC) or maximal ratio combining (MRC) to combine the received signals. New closed-form expressions for probability of positive secrecy and outage are derived. Moreover, asymptotic analysis reveals the outage diversity gain and array gain for the proposed scheme. The impact of number of users, eavesdroppers, and antennas on secrecy performance are clearly demonstrated with mathematical analysis and numerical results.
Secrecy Outage Analysis of Multiuser Downlink Wiretap Networks With SECps Scheduling in Nakagami- m channel
In this letter, we investigate the security of multiuser downlink wiretap networks over Nakagami-m channel, where a base station (BS) serves NB legitimate users and is overheard by NE eavesdroppers. Specifically, to achieve a good tradeoff between the secrecy performance and number of user estimations, we introduce a threshold-based scheduling algorithm, termed switch-and-examine combining with post-examining selection (SECps). Moreover, we consider the practical scenario, where the channel state information (CSI) of the eavesdropper's channel is unavailable at the BS. Building on this, new exact and asymptotic closed-form expressions of the secrecy outage probability are derived for the considered network, which are valid for general systems with an arbitrary number of legitimate users, number of eavesdroppers, channel fading severity, and switching threshold. The findings suggest that with the switching threshold being carefully chosen, the considered SECps scheme achieves a comparable secrecy outage performance with regard to selection combining (SC) scheme while maintaining a lower number of user examinations.
In this letter, we study on-off opportunistic beamforming for the multiuser downlink channel with a passive eavesdropper. Two opportunistic scheduling schemes exploiting multiuser diversity are investigated which require limited feedback of the effective signal-to-noise ratio (SNR) from the legitimate users. For the two scheduling schemes, we derive new closed-form expressions for the ergodic secrecy rate with on-off beamforming over Rayleigh fading channels. Numerical results are provided to verify our analytical results and illustrate the impact of multiuser diversity on the secrecy performance.