TY - JOUR
T1 - Physical Layer Security with Threshold-Based Multiuser Scheduling in Multi-antenna Wireless Networks
AU - Yang, Maoqiang
AU - Guo, Daoxing
AU - Huang, Yuzhen
AU - Duong, Trung Q.
AU - Zhang, Bangning
PY - 2016/9/7
Y1 - 2016/9/7
N2 - 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 (TAS) at the BS and
explores threshold-based selection diversity (tSD) 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., Scenario I:
the eavesdropper’s channel state information (CSI) is unavailable
at the BS, and Scenario II: the eavesdropper’s CSI is available
at the BS. For Scenario I, novel exact closed-form expressions
of 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 closed-form expressions of the exact ergodic
secrecy rate. Additionally, we also provide simple and asymptotic
expressions for secrecy outage probability and ergodic secrecy
rate under two distinct cases, i.e., Case I: the legitimate user is
located close to the BS, and 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
AB - 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 (TAS) at the BS and
explores threshold-based selection diversity (tSD) 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., Scenario I:
the eavesdropper’s channel state information (CSI) is unavailable
at the BS, and Scenario II: the eavesdropper’s CSI is available
at the BS. For Scenario I, novel exact closed-form expressions
of 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 closed-form expressions of the exact ergodic
secrecy rate. Additionally, we also provide simple and asymptotic
expressions for secrecy outage probability and ergodic secrecy
rate under two distinct cases, i.e., Case I: the legitimate user is
located close to the BS, and 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
U2 - 10.1109/TCOMM.2016.2606396
DO - 10.1109/TCOMM.2016.2606396
M3 - Article
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
SN - 0090-6778
ER -