In this paper, we analyze the secrecy outage probability and computation overhead of a multi-user multi-eavesdropper wireless system which is composed of one cluster head (CH) transmitting to multiple users, while multiple eavesdroppers attempt to tap the transmission from CH to multiple users in the presence of co-channel interference (CCI). To achieve high security and low computation overhead, we present two multi-user scheduling schemes, namely, the switch-and-examine combining with post-selection user scheduling (SECpsUS) scheme and the selection combining-based user scheduling (SCbUS) scheme. For the purpose of comparison, the conventional round-robin scheduling (RRS) is also considered as a benchmark scheme. Furthermore, we derive closed-form secrecy outage probability expressions and analyze computation overheads for the conventional RRS, SCbUS, and SECpsUS schemes. Numerical results and Monte Carlo simulations are provided to verify the correctness of our theoretical secrecy outage analysis and to demonstrate the effect of CCI on the system performance. It is shown that the SECpsUS and SCbUS schemes outperform the conventional RRS scheme in terms of their secrecy outage probabilities, where SCbUS achieves the best secrecy outage performance but at cost of the highest computation overhead, while the conventional RRS scheme has no computation overhead with the worst secrecy performance. Moreover, a flexible tradeoff between the secrecy outage performance and computation overhead can be achieved by the proposed SECpsUS scheme by adjusting a so-called switching threshold. In addition, as the number of users increases, the secrecy outage performance of the SECpsUS and SCbUS is improved significantly, whereas no secrecy benefit is achieved by the conventional RRS scheme.
In this paper, we analyze the secrecy outage probability and computation overhead of a multi-user multi-eavesdropper wireless system which is composed of one cluster head (CH) transmitting to multiple users, while multiple eavesdroppers attempt to tap the transmission from CH to multiple users in the presence of co-channel interference (CCI). To achieve high security and low computation overhead, we present two multi-user scheduling schemes, namely, the switch-and-examine combining with post-selection user scheduling (SECpsUS) scheme and the selection combining-based user scheduling (SCbUS) scheme. For the purpose of comparison, the conventional round-robin scheduling (RRS) is also considered as a benchmark scheme. Furthermore, we derive closed-form secrecy outage probability expressions and analyze computation overheads for the conventional RRS, SCbUS, and SECpsUS schemes. Numerical results and Monte Carlo simulations are provided to verify the correctness of our theoretical secrecy outage analysis and to demonstrate the effect of CCI on the system performance. It is shown that the SECpsUS and SCbUS schemes outperform the conventional RRS scheme in terms of their secrecy outage probabilities, where SCbUS achieves the best secrecy outage performance but at cost of the highest computation overhead, while the conventional RRS scheme has no computation overhead with the worst secrecy performance. Moreover, a flexible tradeoff between the secrecy outage performance and computation overhead can be achieved by the proposed SECpsUS scheme by adjusting a so-called switching threshold. In addition, as the number of users increases, the secrecy outage performance of the SECpsUS and SCbUS is improved significantly, whereas no secrecy benefit is achieved by the conventional RRS scheme.
This paper analyzes the secrecy outage probability of a cellular downlink system which consists of multiple users, one base station (BS), and one eavesdropper in the presence of co-channel interferers, where the BS transmits its signals to users which are distributed according to a Poisson point process with a fixed density, while the eavesdropper attempts to tap the transmission from the BS to the users. To enhance the transmission security against eavesdropping, we propose two multiuser scheduling schemes, namely, the partial channel state information (CSI) aided user scheduling (PCSI-US) scheme where only the CSIs of users are available without knowing the co-channel interferers' CSIs and the full CSI aided user scheduling (FCSI-US) scheme which requires the CSIs of both users and interferers. For comparison purposes, the conventional round-robin scheduling scheme is also considered as a baseline. We derive closed-form expressions of the secrecy outage probability for the proposed PCSI-US and FCSI-US as well as conventional round-robin scheduling schemes in co-channel interference (CCI) environments. Numerical results show that the proposed FCSI-US and PCSI-US schemes outperform the conventional round-robin scheduling in terms of their secrecy outage probabilities, where FCSI-US achieves the best secrecy outage performance in CCI environments. It is also demonstrated that increasing the mean number of users has a marginal effect on the secrecy performance of conventional round-robin scheduling, which can significantly decrease the secrecy outage probabilities of PCSI-US and FCSI-US schemes. This further validates the secrecy effectiveness of the proposed user scheduling methods in terms of combating the CCI.
In this paper, we investigate the security and reliability trade-off (SRT) for a wireless sensor network (WSN) which consists of one cluster head (CH), multiple users, and one eavesdropper (E), where the eavesdropper attempts to tap the confidential transmission between multiple users and CH. We first present two multiuser scheduling schemes, namely the selection combining (SC) scheme and the switch-and-examine combining with post-selection (SECps) scheme to enhance physical-layer security (PLS) of the WSN system. For comparison purposes, the round-robin scheduling (RRS) scheme is also considered as a baseline. Then, we analyze the SRT of the RRS, SECps, and SC schemes by deriving their closed-form outage and intercept probability expressions under the joint impact of hardware impairment (HI) and co-channel interference (CCI). And, secrecy diversity analysis of the three schemes is also carried out. Numerical results show that the SC and SECps scheme outperform the RRS scheme in terms of the SRT performance, where the SC scheme can achieve the best SRT performance at the cost of an increased channel estimation complexity. Moreover, a trade-off between the security and reliability can be achieved for each of the RRS, SECps, and SC schemes by adjusting the overall data rate and signal-to-noise ratio (SNR).
In this paper, we explore the physical-layer security of a multi-user cellular network in the presence of an eavesdropper, which is made up of multiple users communicating with a base station while the eavesdropper may intercept the communications from users to the base station (BS). Considering that multiple users are available in cellular network, we present three multi-user scheduling schemes, namely the round-robin scheduling scheme, the suboptimal and optimal user scheduling schemes to improve the security of communication (from users to BS) against the eavesdropping attack. In the suboptimal scheduling, we only need to assume that the channel state information (CSI) of the main link spanning from users to BS are known. In contrast to the suboptimal scheduling, the optimal scheduling is designed by assuming the CSI of the main link and wiretap link (spanning from users to the eavesdropper) that are available. We obtain the calculus form of the secrecy outage probability to analyze the secrecy diversity performance. Secrecy diversity analysis is carried out, which shows that the round-robin always achieves only one diversity order, whereas the suboptimal and optimal user scheduling schemes achieve the full diversity order. In addition, the results of the secrecy outage show that the optimal scheduling has the best performance and the round-robin performs the worst in terms of defending against the eavesdropping attack. Lastly, as the number of users increases, both the secrecy outage probabilities of the suboptimal and optimal scheduling schemes have a significant secrecy performance improvement.
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.
This paper studies the physical-layer security of a multi-user multi-eavesdropper cellular network , which is composed of multiple users communicating with a base station while the eavesdroppers may intercept the communications from users to the base station (BS). The cellular network is a time-slotted system with simultaneously transmission, in each time slot, a single user is scheduled to transmit messages to BS while the remaining users opportunistically receive information. Considering multiple users available in the cellular network, we present three multi-user scheduling schemes, namely the round-robin scheduling scheme as well as the suboptimal and optimal user scheduling schemes to improve the security of communication (from users to BS) against eavesdropping attacks. We only need to assume that the channel state information (CSI) of the main link spanning from users to BS is known in the suboptimal scheduling. On the contrary, the optimal scheduling is designed by assuming that the CSI of the main link and wiretap link (spanning from users to the eavesdropper) are available. We further carry out secrecy diversity analysis and show that the round-robin always achieves only one diversity order, whereas the suboptimal and optimal user scheduling schemes achieve the full diversity. In addition, numerical results illustrate that the optimal scheduling performs the best and the round-robin has the worst performance in terms of the secrecy outage probability . Last, as the number of users increases, the secrecy outage probabilities of the suboptimal and optimal scheduling schemes decrease significantly.
In this paper, we investigate the physical-layer security of a multi-user multi-eavesdropper cognitive radio system, which is composed of multiple cognitive users (CUs) transmitting to a common cognitive base station (CBS), {while multiple eavesdroppers may collaborate with each other or perform independently in intercepting the CUs-CBS transmissions, which are called the coordinated and uncoordinated eavesdroppers, respectively}. Considering multiple CUs available, we propose the round-robin scheduling as well as the optimal and suboptimal user scheduling schemes for improving the security of CUs-CBS transmissions against eavesdropping attacks. Specifically, the optimal user scheduling is designed by assuming that the channel state information (CSI) of all links from CUs to CBS, to primary user (PU) and to eavesdroppers are available. By contrast, the suboptimal user scheduling only requires the CSI of CUs-CBS links without the PU's and eavesdroppers' CSI. We derive closed-form expressions of the secrecy outage probability of these three scheduling schemes in the presence of {the coordinated and uncoordinated eavesdroppers}. We also carry out the secrecy diversity analysis and show that the round-robin scheduling achieves the diversity order of only one, whereas the optimal and suboptimal scheduling schemes obtain the full secrecy diversity, {no matter whether the eavesdroppers collaborate or not. In addition, numerical secrecy outage results demonstrate that for both the coordinated and uncoordinated eavesdroppers, the optimal user scheduling achieves the best security performance and the round-robin scheduling performs the worst.} Finally, upon increasing the number of CUs, the secrecy outage probabilities of the optimal and suboptimal user scheduling schemes both improve significantly.