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

arXiv:1406.5732 · IEEE Journal on Selected Areas in Communications

Secrecy Outage and Diversity Analysis of Cognitive Radio Systems

Yulong Zou, Xuelong Li, Ying‐Chang Liang

Published Nov 1, 2014• 157 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/jsac.2014.141121

Related papers

Secrecy outage analysis of multi-user cellular networks in the face of cochannel interference

Yuan Heng Jiang, Jia Zhu, Yulong Zou

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.

IEEE International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)•Jul 1, 2015•9 citations

Secrecy diversity analysis with Multi-user scheduling for overlay cognitive radio systems

Peishun Yan, Yulong Zou, Jia Zhu

In this paper, we consider a cognitive radio (CR) network which is made up of multiple secondary users (SUs), a secondary destination (SD) and an eavesdropper (E) which may overhear the legitimate communication between SUs and SD. In order to ensure the secure communication from SUs to SD, we investigate round-robin scheduling and optimal user scheduling to prohibit eavesdropper attacking. In optimal user scheduling, the channel state information (CSI) of all links including SUs-D, SUs-E, primary user (PU)-D and PU-E are available. Because of intercept probability is an important metric of security for wireless communications, we discuss the intercept probability of both scheduling. To further present the impact of number of users on secrecy performance, we also analyze the secrecy diversity of round robin scheduling and optimal user scheduling. Final results indicate that round robin scheduling obtains only one diversity order, however optimal user scheduling achieves full diversity order. Additionally, optimal user scheduling performs better than round robin scheduling in terms of intercept probability and the secrecy performance will significantly improve as the number of users increases.

International Symposium on Wireless Personal Multimedia Communications (WPMC)•Nov 1, 2016•3 citations

Secrecy outage analysis of multi-user multi-eavesdropper cellular networks in the face of cochannel interference

Yuan Heng Jiang, Jia Zhu, Yulong Zou

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.

Digital Communications and Networks•Feb 1, 2015•11 citations

Secure Cognitive Satellite-Terrestrial Networks: From Adaptive Eavesdropper Perspective

Xiao Feng Jiang, Peishun Yan, Bin Li +4 more

This paper investigates the physical layer security for a cognitive satellite-terrestrial Internet-of-Things (IoT) network where a secondary base station (BS) communicates with multiple secondary users (Us) in the presence of an adaptive eavesdropper, which performs eavesdropping when the channel quality of the eavesdropping link is good and performs jamming otherwise. We consider a real situation where mutual interference exists between primary and secondary networks. Considering multiple secondary users available, we propose suboptimal user scheduling and optimal scheduling schemes to improve the secure transmission of BS-Us. Specifically, a user that maximizes the secrecy capacity of the system will be selected in the optimal scheduling scheme, which assumes that the channel state information (CSI) of all links is available. By contrast, the suboptimal scheduling scheme only knows the main links’ CSI, so the user maximizing the CSI of the main links is chosen. We derive the exact and asymptotic closed-form secrecy outage probability expressions for suboptimal and optimal scheduling schemes. For comparison, we also obtain the exact and asymptotic closed-form secrecy outage probability expressions for round-robin scheme. Numerical results show that the suboptimal and optimal user scheduling schemes perform better than round-robin user scheduling scheme in terms of secrecy outage probability. In addition, the secrecy performance of proposed suboptimal and optimal schemes can be improved by increasing the number of secondary users.

IEEE Transactions on Cognitive Communications and Networking•Nov 10, 2025•4 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

Closed-Form Secrecy Outage Analysis of Cellular Downlink Systems in the Presence of Co-Channel Interference

Bin Li, Jianjiang Zhou, Yulong Zou +1 more

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.

IEEE Transactions on Wireless Communications•May 3, 2018•17 citations
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.
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 consider a cognitive radio (CR) network which is made up of multiple secondary users (SUs), a secondary destination (SD) and an eavesdropper (E) which may overhear the legitimate communication between SUs and SD. In order to ensure the secure communication from SUs to SD, we investigate round-robin scheduling and optimal user scheduling to prohibit eavesdropper attacking. In optimal user scheduling, the channel state information (CSI) of all links including SUs-D, SUs-E, primary user (PU)-D and PU-E are available. Because of intercept probability is an important metric of security for wireless communications, we discuss the intercept probability of both scheduling. To further present the impact of number of users on secrecy performance, we also analyze the secrecy diversity of round robin scheduling and optimal user scheduling. Final results indicate that round robin scheduling obtains only one diversity order, however optimal user scheduling achieves full diversity order. Additionally, optimal user scheduling performs better than round robin scheduling in terms of intercept probability and the secrecy performance will significantly improve as the number of users increases.
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.
This paper investigates the physical layer security for a cognitive satellite-terrestrial Internet-of-Things (IoT) network where a secondary base station (BS) communicates with multiple secondary users (Us) in the presence of an adaptive eavesdropper, which performs eavesdropping when the channel quality of the eavesdropping link is good and performs jamming otherwise. We consider a real situation where mutual interference exists between primary and secondary networks. Considering multiple secondary users available, we propose suboptimal user scheduling and optimal scheduling schemes to improve the secure transmission of BS-Us. Specifically, a user that maximizes the secrecy capacity of the system will be selected in the optimal scheduling scheme, which assumes that the channel state information (CSI) of all links is available. By contrast, the suboptimal scheduling scheme only knows the main links’ CSI, so the user maximizing the CSI of the main links is chosen. We derive the exact and asymptotic closed-form secrecy outage probability expressions for suboptimal and optimal scheduling schemes. For comparison, we also obtain the exact and asymptotic closed-form secrecy outage probability expressions for round-robin scheme. Numerical results show that the suboptimal and optimal user scheduling schemes perform better than round-robin user scheduling scheme in terms of secrecy outage probability. In addition, the secrecy performance of proposed suboptimal and optimal schemes can be improved by increasing the number of secondary users.
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 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.