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

China Communications

An anti-eavesdrop transmission scheduling scheme based on maximizing secrecy outage probability in ad hoc networks

Wang Yajun, Liao Tongqing, Wang Chuanan

Published Jan 1, 2016• 6 citations
Publisher

Abstract

In this paper, we consider a wireless ad hoc network consisting of multiple source nodes transmitting to their respective destinations, where an eavesdropper attempts to intercept their transmissions. We propose an optimal transmission scheduling scheme to defend against the eavesdropper, where a source node having the highest secrecy rate is scheduled to access the wireless medium for transmitting to its destination in an opportunistic manner. To be specific, the secrecy rate between a pair of the source and destination in the presence of an eavesdropper varies temporally due to the wireless fading effect. The proposed optimal transmission scheduling scheme opportunistically selects a source node with the highest secrecy rate to transmit its data for the sake of maximizing the security of the ad hoc network against eavesdropping attacks. For comparison purposes, we also consider the conventional round-robin scheduling as a benchmark, where multiple source nodes take turns in accessing their shared wireless medium for transmitting to their respective destinations. We derive closed-form secrecy outage probability expressions of both the round-robin scheduling and the proposed optimal scheduling schemes over Rayleigh fading environments. Numerical results show that the proposed transmission scheduling scheme outperforms the conventional round-robin method in terms of its secrecy outage probability. Additionally, upon increasing the number of source-destination pairs, the secrecy outage probability of the round-robin scheme keeps unchanged, whereas the secrecy outage performance of the proposed transmission scheduling significantly improves, showing the security benefits of exploiting transmission scheduling for protecting wireless ad hoc networks against eavesdropping.

DOI
10.1109/cc.2016.7405714

Related papers

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

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

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 Outage and Diversity Analysis of Multiple Cooperating Source-Destination Pairs

Xiaojin Ding, Yulong Zou, Xiaoshu Chen +2 more

We study the physical-layer security of multiple source-destination (SD) pairs communicating within a wireless network in the face of an eavesdropper attacking the SD pairs. In order to protect the wireless transmission against eavesdropping, we propose a cooperation framework relying on two stages. Specifically, an SD pair is selected to access the total allocated spectrum using an appropriately designed scheme at the beginning of the first stage. The other source nodes (SNs) simultaneously transmit their data to the SN of the above-mentioned SD pair relying on orthogonal resources during the first stage. Then, the SN of the chosen SD pair transmits the data packets containing its own messages and the other SNs' messages to its dedicated destination node (DN) in the second stage. Finally, this dedicated DN will forward all the other DNs' data to the application center via the core network. We conceive a specific SD pair selection scheme, termed as the transmit antenna selection aided source-destination pair selection (TAS-SDPS). We continue by deriving the secrecy outage probability (SOP) expressions of both the TAS-SDPS conceived, as well as of the conventional round-robin source-destination pair selection (RSDPS) and of the conventional non-cooperative (Non-coop) schemes for comparison. Furthermore, we carry out the secrecy diversity gain analysis in the high main-to-eavesdropper ratio (MER) region, showing that the TAS-SDPS scheme is capable of achieving the maximum attainable secrecy diversity order. Additionally, we show that increasing the number of transmitting pairs will reduce the SOP, whilst increasing the secrecy diversity order of the TAS-SDPS scheme. It is demonstrated that the SOP of the TAS-SDPS scheme is better than that of the RSDPS and of the conventional Non-coop schemes. We also demonstrate that the secrecy diversity gain of the proposed TAS-SDPS scheme is $M$ times that of the RSDPS scheme in the high-MER region, where $M$ is the number of the SD pairs.

IEEE Transactions on Vehicular Technology•Apr 20, 2020•3 citations

Performance of opportunistic scheduling for physical layer security with transmit antenna selection

Anish Prasad Shrestha, Kyung Sup Kwak

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.

EURASIP Journal on Wireless Communications and Networking•Mar 4, 2014•11 citations

Secrecy Versus Computation Overhead for Wireless Networks in the Face of Co-Channel Interference

Bin Li, Jianjiang Zhou, Yulong Zou +2 more

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.

IEEE Transactions on Communications•Dec 10, 2018•9 citations
In this paper, we consider a wireless ad hoc network consisting of multiple source nodes transmitting to their respective destinations, where an eavesdropper attempts to intercept their transmissions. We propose an optimal transmission scheduling scheme to defend against the eavesdropper, where a source node having the highest secrecy rate is scheduled to access the wireless medium for transmitting to its destination in an opportunistic manner. To be specific, the secrecy rate between a pair of the source and destination in the presence of an eavesdropper varies temporally due to the wireless fading effect. The proposed optimal transmission scheduling scheme opportunistically selects a source node with the highest secrecy rate to transmit its data for the sake of maximizing the security of the ad hoc network against eavesdropping attacks. For comparison purposes, we also consider the conventional round-robin scheduling as a benchmark, where multiple source nodes take turns in accessing their shared wireless medium for transmitting to their respective destinations. We derive closed-form secrecy outage probability expressions of both the round-robin scheduling and the proposed optimal scheduling schemes over Rayleigh fading environments. Numerical results show that the proposed transmission scheduling scheme outperforms the conventional round-robin method in terms of its secrecy outage probability. Additionally, upon increasing the number of source-destination pairs, the secrecy outage probability of the round-robin scheme keeps unchanged, whereas the secrecy outage performance of the proposed transmission scheduling significantly improves, showing the security benefits of exploiting transmission scheduling for protecting wireless ad hoc networks against eavesdropping.
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 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.
We study the physical-layer security of multiple source-destination (SD) pairs communicating within a wireless network in the face of an eavesdropper attacking the SD pairs. In order to protect the wireless transmission against eavesdropping, we propose a cooperation framework relying on two stages. Specifically, an SD pair is selected to access the total allocated spectrum using an appropriately designed scheme at the beginning of the first stage. The other source nodes (SNs) simultaneously transmit their data to the SN of the above-mentioned SD pair relying on orthogonal resources during the first stage. Then, the SN of the chosen SD pair transmits the data packets containing its own messages and the other SNs' messages to its dedicated destination node (DN) in the second stage. Finally, this dedicated DN will forward all the other DNs' data to the application center via the core network. We conceive a specific SD pair selection scheme, termed as the transmit antenna selection aided source-destination pair selection (TAS-SDPS). We continue by deriving the secrecy outage probability (SOP) expressions of both the TAS-SDPS conceived, as well as of the conventional round-robin source-destination pair selection (RSDPS) and of the conventional non-cooperative (Non-coop) schemes for comparison. Furthermore, we carry out the secrecy diversity gain analysis in the high main-to-eavesdropper ratio (MER) region, showing that the TAS-SDPS scheme is capable of achieving the maximum attainable secrecy diversity order. Additionally, we show that increasing the number of transmitting pairs will reduce the SOP, whilst increasing the secrecy diversity order of the TAS-SDPS scheme. It is demonstrated that the SOP of the TAS-SDPS scheme is better than that of the RSDPS and of the conventional Non-coop schemes. We also demonstrate that the secrecy diversity gain of the proposed TAS-SDPS scheme is MMM times that of the RSDPS scheme in the high-MER region, where MMM is the number of the SD pairs.
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.
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.