Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Communications

Physical Layer Security With Threshold-Based Multiuser Scheduling in Multi-Antenna Wireless Networks

Maoqiang Yang, Daoxing Guo, Yuzhen Huang, Trung Q. Duong, Bangning Zhang

Published Sep 7, 2016• 60 citations
Publisher

Abstract

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.

DOI
10.1109/tcomm.2016.2606396

Related papers

Secure Multiuser Scheduling in Downlink Dual-Hop Regenerative Relay Networks Over Nakagami- $m$ Fading Channels

Maoqiang Yang, Daoxing Guo, Yuzhen Huang +2 more

In this paper, we investigate the secrecy performance of multiuser dual-hop relay networks where a base station (BS) communicates with multiple legitimate users through the assistance of a trustful regenerative relay in the presence of multiple eavesdroppers. In particular, the maximal ratio transmission scheme is exploited at the BS and a threshold-based multiuser scheduling scheme is employed over the legitimate users, while concerning the imperfect decoding at the regenerative relay. To evaluate the secrecy performance of the considered system, two practical situations are addressed based on the availability of eavesdropper's channel state information (CSI), i.e., Scenario I, where the eavesdropper's CSI is not available at the relay, and Scenario II, where the eavesdropper's CSI is available at the relay. For both the scenarios, we further consider two eavesdropping modes, i.e., colluding eavesdropping and non-colluding eavesdropping. For Scenario I, new exact and asymptotic closed-form expressions for the secrecy outage probability (SOP) are derived. For Scenario II, we derive new exact and asymptotic closed-form expressions for the ergodic secrecy rate (ESR). The asymptotic SOPs demonstrate that the secrecy diversity order is independent of the number of legitimate users NB and eavesdroppers NE, the number of antennas equipped at eavesdroppers AE, as well as the fading factor of the wiretap channel mE. Furthermore, we also determine the secrecy multiplexing gain and the power cost to explicitly quantify the impact of the legitimate channel and wiretap channel on the ESR. Our findings demonstrate that increasing the switching threshold, the number of antennas at the BS, and the number of legitimate users has a positive impact on secrecy performance.

IEEE Transactions on Wireless Communications•Sep 19, 2016•60 citations

Secrecy Outage Analysis of Multiuser Downlink Wiretap Networks With SECps Scheduling in Nakagami- $m$ channel

Maoqiang Yang, Bangning Zhang, Yuzhen Huang +1 more

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.

IEEE Wireless Communications Letters•Jul 20, 2016•8 citations

Secure Transmission With Antenna Selection in MIMO Nakagami- mmm Fading Channels

Lifeng Wang, Maged Elkashlan, Jing Huang +2 more

This paper considers transmit antenna selection (TAS) and receive generalized selection combining (GSC) for secure communication in the multiple-input-multiple-output wiretap channel, where confidential messages transmitted from an NA-antenna transmitter to an NB-antenna legitimate receiver are overheard by an NE-antenna eavesdropper. We assume that the main channel and the eavesdropper's channel undergo Nakagami-m fading with fading parameters mB and mE, respectively. In order to assess the secrecy performance, we present a new unifying framework for the average secrecy rate and the secrecy outage probability. We first derive expressions for the probability density function and the cumulative distribution function of the signal-to-noise ratio with TAS/GSC, from which we derive exact expressions for the average secrecy rate and the secrecy outage probability. We then derive compact expressions for the asymptotic average secrecy rate and the asymptotic secrecy outage probability for two distinct scenarios: 1) the legitimate receiver is located close to the transmitter, and 2) the legitimate receiver and the eavesdropper are located close to the transmitter. For these scenarios, we present new closed-form expressions for several key performance indicators: 1) the capacity slope and the power offset of the asymptotic average secrecy rate, and 2) the secrecy diversity order and the secrecy array gain of the asymptotic secrecy outage probability. For the first scenario, we confirm that the capacity slope is one and the secrecy diversity order is mBNBNA. For the second scenario, we confirm that the capacity slope and the secrecy diversity order collapse to zero.

IEEE Transactions on Wireless Communications•Sep 23, 2014•163 citations

Secrecy analysis of multiuser downlink wiretap networks with opportunistic scheduling

Xin Ge, Peiran Wu, Hu Jin +1 more

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.

International Conference on Communications•Jun 1, 2015•14 citations

Secrecy outage probability analysis of multi-user multi-eavesdropper wireless systems

Yulong Zou, Jia Zhu, Gongpu Wang +1 more

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 multiuser 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 multiuser 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.

arXiv:1411.0220•IEEE/CIC International Conference on Communications in China (ICCC)•Oct 1, 2014•8 citations

The Security of Cognitive Multiuser Networks Over Space-and-Time Correlated Channels

Mu Li, Hao Yin, Yuzhen Huang +2 more

In this paper, we investigate the secrecy performance of cognitive multi-input multi-output multiuser (MIMO-MU) wiretap networks over space-and-time correlated fading channels. Specifically, we propose a joint transmit antenna selection (TAS) and multiuser scheduling scheme to improve the security of the considered system. To thoroughly analyze the impact of the joint TAS and multiuser scheduling scheme and the channel correlation on the physical layer security, the new exact and asymptotic closed-form expressions for the secrecy outage probability of cognitive MIMO-MU wiretap networks are derived in two distinct scenarios, i.e., space-and-time correlated fading channels and independent-and-perfect fading channels. From the theoretical and simulation results, several important remarks are concluded as follows. 1) The channel space correlation does not affect the achievable secrecy diversity order in a high main-to-eavesdropper ratio (MER) regime. While it produces different impacts on the secrecy performance with different values of the MER in a low MER regime. 2) The channel time correlation on the main channel can reduce the achievable secrecy diversity order from$N_{\rm A}N_{\rm B}$to 1. 3) The joint TAS and multiuser scheduling scheme can achieve better performance than the traditional random scheduling scheme over space-and-time correlated fading channels.

IEEE Systems Journal•Mar 18, 2019•9 citations
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.
Secure Multiuser Scheduling in Downlink Dual-Hop Regenerative Relay Networks Over Nakagami- mmm Fading Channels
In this paper, we investigate the secrecy performance of multiuser dual-hop relay networks where a base station (BS) communicates with multiple legitimate users through the assistance of a trustful regenerative relay in the presence of multiple eavesdroppers. In particular, the maximal ratio transmission scheme is exploited at the BS and a threshold-based multiuser scheduling scheme is employed over the legitimate users, while concerning the imperfect decoding at the regenerative relay. To evaluate the secrecy performance of the considered system, two practical situations are addressed based on the availability of eavesdropper's channel state information (CSI), i.e., Scenario I, where the eavesdropper's CSI is not available at the relay, and Scenario II, where the eavesdropper's CSI is available at the relay. For both the scenarios, we further consider two eavesdropping modes, i.e., colluding eavesdropping and non-colluding eavesdropping. For Scenario I, new exact and asymptotic closed-form expressions for the secrecy outage probability (SOP) are derived. For Scenario II, we derive new exact and asymptotic closed-form expressions for the ergodic secrecy rate (ESR). The asymptotic SOPs demonstrate that the secrecy diversity order is independent of the number of legitimate users NB and eavesdroppers NE, the number of antennas equipped at eavesdroppers AE, as well as the fading factor of the wiretap channel mE. Furthermore, we also determine the secrecy multiplexing gain and the power cost to explicitly quantify the impact of the legitimate channel and wiretap channel on the ESR. Our findings demonstrate that increasing the switching threshold, the number of antennas at the BS, and the number of legitimate users has a positive impact on secrecy performance.
Secrecy Outage Analysis of Multiuser Downlink Wiretap Networks With SECps Scheduling in Nakagami- mmm 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.
This paper considers transmit antenna selection (TAS) and receive generalized selection combining (GSC) for secure communication in the multiple-input-multiple-output wiretap channel, where confidential messages transmitted from an NA-antenna transmitter to an NB-antenna legitimate receiver are overheard by an NE-antenna eavesdropper. We assume that the main channel and the eavesdropper's channel undergo Nakagami-m fading with fading parameters mB and mE, respectively. In order to assess the secrecy performance, we present a new unifying framework for the average secrecy rate and the secrecy outage probability. We first derive expressions for the probability density function and the cumulative distribution function of the signal-to-noise ratio with TAS/GSC, from which we derive exact expressions for the average secrecy rate and the secrecy outage probability. We then derive compact expressions for the asymptotic average secrecy rate and the asymptotic secrecy outage probability for two distinct scenarios: 1) the legitimate receiver is located close to the transmitter, and 2) the legitimate receiver and the eavesdropper are located close to the transmitter. For these scenarios, we present new closed-form expressions for several key performance indicators: 1) the capacity slope and the power offset of the asymptotic average secrecy rate, and 2) the secrecy diversity order and the secrecy array gain of the asymptotic secrecy outage probability. For the first scenario, we confirm that the capacity slope is one and the secrecy diversity order is mBNBNA. For the second scenario, we confirm that the capacity slope and the secrecy diversity order collapse to zero.
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.
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 multiuser 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 multiuser 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.
In this paper, we investigate the secrecy performance of cognitive multi-input multi-output multiuser (MIMO-MU) wiretap networks over space-and-time correlated fading channels. Specifically, we propose a joint transmit antenna selection (TAS) and multiuser scheduling scheme to improve the security of the considered system. To thoroughly analyze the impact of the joint TAS and multiuser scheduling scheme and the channel correlation on the physical layer security, the new exact and asymptotic closed-form expressions for the secrecy outage probability of cognitive MIMO-MU wiretap networks are derived in two distinct scenarios, i.e., space-and-time correlated fading channels and independent-and-perfect fading channels. From the theoretical and simulation results, several important remarks are concluded as follows. 1) The channel space correlation does not affect the achievable secrecy diversity order in a high main-to-eavesdropper ratio (MER) regime. While it produces different impacts on the secrecy performance with different values of the MER in a low MER regime. 2) The channel time correlation on the main channel can reduce the achievable secrecy diversity order fromNANBN_{\rm A}N_{\rm B}NA​NB​to 1. 3) The joint TAS and multiuser scheduling scheme can achieve better performance than the traditional random scheduling scheme over space-and-time correlated fading channels.