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 International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

Average Secrecy Throughput Analysis with Multiple Eavesdroppers in the Finite Blocklength

Nihan Arı, Nikolaos Thomos, Leila Musavian

Published Aug 1, 2020• 7 citations
Publisher

Abstract

This paper studies the problem of secure communication from a transmitter to a receiver with the use of short packets under the existence of multiple eavesdroppers, who are overhearing the transmission. We assume that the eavesdroppers are mutually independent. Further, we consider that the main channel and eavesdropper channels are Rayleigh fading, then use the performance metric of average secrecy throughput to measure how secure the communication is. We derive a closed form approximation of the average secrecy throughput in the presence of multiple eavesdroppers. Finally, the approximation is validated through simulations and we have seen that the approximation is very close to the corresponding simulation results.

DOI
10.1109/pimrc48278.2020.9217327

Related papers

Performance Analysis of Short Packet Communications With Multiple Eavesdroppers

Nihan Arı, Nikolaos Thomos, Leila Musavian

This paper studies the performance of short packet communications in the presence of multiple eavesdroppers. We start our investigation by examining the fading wiretap channel, where the communication is overheard by multiple non-colluding single antenna eavesdroppers. A closed-form expression for the average secrecy throughput is derived, when the transmitter has a single antenna. The Monte-Carlo simulations show a close match of the analytical expression with the numerical results. Moreover, the optimal blocklength value that maximizes the secrecy throughput is determined, when the communication is observed by single and multiple eavesdroppers. We then extend our analysis for the case of a multiple-antenna transmitter and consider artificial noise (AN) to confuse the eavesdroppers. A closed-form expression for the average secrecy throughput is obtained for the scenario of a two-antenna transmitter and two eavesdroppers with a single antenna. The results demonstrate the validity of the approximation when compared with Monte-Carlo simulations. The results further reveal that an increased number of antennas at the transmitter is associated with higher average secrecy throughput and applying AN helps to eliminate the harm of the eavesdroppers.

IEEE Transactions on Communications•Aug 11, 2022•33 citations

Active Eavesdropping in Short Packet Communication: Average Secrecy Throughput Analysis

Nihan Arı, Nikolaos Thomos, Leila Musavian

In this paper, we investigate secure short packet transmission from a legitimate transmitter to a receiver in the presence of an active eavesdropper. The aim is to gain more insights into how an active eavesdropper affects the secrecy throughput of short packet communications. The eavesdropper is assumed to have full-duplex (FD) capability, which enables performing eavesdropping and jamming simultaneously. All the communication links in the wiretap channel are assumed to be Rayleigh fading. An approximation of the average achievable secrecy throughput is proposed to measure the security of the system. The proposed approximation is examined and analysed in two different topology scenarios, which are triangular and line topologies. Then, Monte-Carlo simulations are performed to get an understanding of how good the approximation is. The results show that the closed-form expressions have a good match with Monte-Carlo simulations. We also investigate the impact of the eavesdropper's distance to the legitimate nodes as well as the different jamming power levels. Furthermore, self-interference influence on the eavesdropper is discussed.

IEEE International Conference on Communications workshops•Jun 1, 2021•6 citations

Secrecy Performance of Short Packet Communications: Wiretap Channel with Multiple Receivers and Eavesdroppers

Nihan Arı, Nikolaos Thomos, Leila Musavian

In this paper, we study the secrecy performance of short packet secure communications over a fading wiretap channel when there are multiple receivers and eavesdroppers. In particular, we evaluate and compare the performance of colluding and non-colluding eavesdropping modes, in terms of achievable secrecy throughput. Our aim is to determine whether eavesdroppers' collusion degrades the average secrecy throughput compared to a non-colluding scenario. After deriving closed-form approximations on average secrecy throughput for both scenarios, Monte-Carlo simulations are performed to obtain the accuracy of each approximation. Our results reveal that the impact of colluding eavesdroppers on the average secrecy throughput causes more loss than a non-colluding case, especially with the increasing number. Besides, an increased number of receivers does not eliminate the negative impact of eavesdroppers.

International Wireless Communications and Mobile Computing Conference (IWCMC)•May 30, 2022•3 citations

Secure wireless multicasting through Rayleigh fading channels — A secrecy tradeoff

Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah, Mathini Sellathurai

In this paper, a wireless multicast scenario is considered in which the transmitter sends a common message to multiple client receivers in the presence of an eavesdropper. We are interested in protecting this common message against eavesdropping. Based on an information-theoretic formulation of the problem, in which the transmitter and the mutually independent multiple client receivers communicate over quasi-static Rayleigh fading channels and an eavesdropper observes their transmissions through another quasi-static Rayleigh fading channel, we define the secrecy-sum capacity in terms of secure outage probability. Moreover, we also present a formulation of ergodic perfect secrecy multicast capacity at which the eavesdropper is unable to decode any information.

UK-India International Workshop on Cognitive Wireless Systems (UKIWCWS)•Dec 1, 2009•14 citations

Secure Communications through Rayleigh Fading SIMO Channel with Multiple Eavesdroppers

M. Z. I. Sarkar, Tharmalingam Ratnarajah

We consider a single-input multiple-output (SIMO) Rayleigh fading broadcast channel, where the transmitter sends some confidential information to one user which is a legitimate receiver in the presence of multiple eavesdroppers. The eavesdroppers are mutually independent and perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while insuring that each eavesdropper gets zero bits of information. Here, we find the probability of non-zero secrecy mutual information and secure outage probability to investigate the outage behavior of proposed model. We also present a formulation of ergodic secrecy mutual information in the presence of multiple eavesdroppers.

International Conference on Communications•May 1, 2010•9 citations

Secrecy capacity of correlated rayleigh fading channels

Jinxiao Zhu, Xiaohong Jiang, Osamu Takahashi +1 more

We consider the secure transmission of information over Rayleigh fading wiretap channel when the main and eavesdropper channels are correlated there. Assuming that before transmission the transmitter knows the full channel state information (CSI) of both the main and eavesdropper channels, we analyze the average secrecy capacity with limited signal-to-noise ratio (SNR), for which a simple closed-form expression is derived based on the typical Marcum Q function. This is achieved by exploring the symmetry property between the main channel and eavesdropper channel to avoid a complicated integration involved in the secrecy capacity analysis, such that the secrecy capacity derivation can be significantly simplified. Numerical results are also provided to confirm our analytical ones.

Asia-Pacific Conference on Communications (APCC)•Oct 1, 2012•5 citations
This paper studies the problem of secure communication from a transmitter to a receiver with the use of short packets under the existence of multiple eavesdroppers, who are overhearing the transmission. We assume that the eavesdroppers are mutually independent. Further, we consider that the main channel and eavesdropper channels are Rayleigh fading, then use the performance metric of average secrecy throughput to measure how secure the communication is. We derive a closed form approximation of the average secrecy throughput in the presence of multiple eavesdroppers. Finally, the approximation is validated through simulations and we have seen that the approximation is very close to the corresponding simulation results.
This paper studies the performance of short packet communications in the presence of multiple eavesdroppers. We start our investigation by examining the fading wiretap channel, where the communication is overheard by multiple non-colluding single antenna eavesdroppers. A closed-form expression for the average secrecy throughput is derived, when the transmitter has a single antenna. The Monte-Carlo simulations show a close match of the analytical expression with the numerical results. Moreover, the optimal blocklength value that maximizes the secrecy throughput is determined, when the communication is observed by single and multiple eavesdroppers. We then extend our analysis for the case of a multiple-antenna transmitter and consider artificial noise (AN) to confuse the eavesdroppers. A closed-form expression for the average secrecy throughput is obtained for the scenario of a two-antenna transmitter and two eavesdroppers with a single antenna. The results demonstrate the validity of the approximation when compared with Monte-Carlo simulations. The results further reveal that an increased number of antennas at the transmitter is associated with higher average secrecy throughput and applying AN helps to eliminate the harm of the eavesdroppers.
In this paper, we investigate secure short packet transmission from a legitimate transmitter to a receiver in the presence of an active eavesdropper. The aim is to gain more insights into how an active eavesdropper affects the secrecy throughput of short packet communications. The eavesdropper is assumed to have full-duplex (FD) capability, which enables performing eavesdropping and jamming simultaneously. All the communication links in the wiretap channel are assumed to be Rayleigh fading. An approximation of the average achievable secrecy throughput is proposed to measure the security of the system. The proposed approximation is examined and analysed in two different topology scenarios, which are triangular and line topologies. Then, Monte-Carlo simulations are performed to get an understanding of how good the approximation is. The results show that the closed-form expressions have a good match with Monte-Carlo simulations. We also investigate the impact of the eavesdropper's distance to the legitimate nodes as well as the different jamming power levels. Furthermore, self-interference influence on the eavesdropper is discussed.
In this paper, we study the secrecy performance of short packet secure communications over a fading wiretap channel when there are multiple receivers and eavesdroppers. In particular, we evaluate and compare the performance of colluding and non-colluding eavesdropping modes, in terms of achievable secrecy throughput. Our aim is to determine whether eavesdroppers' collusion degrades the average secrecy throughput compared to a non-colluding scenario. After deriving closed-form approximations on average secrecy throughput for both scenarios, Monte-Carlo simulations are performed to obtain the accuracy of each approximation. Our results reveal that the impact of colluding eavesdroppers on the average secrecy throughput causes more loss than a non-colluding case, especially with the increasing number. Besides, an increased number of receivers does not eliminate the negative impact of eavesdroppers.
In this paper, a wireless multicast scenario is considered in which the transmitter sends a common message to multiple client receivers in the presence of an eavesdropper. We are interested in protecting this common message against eavesdropping. Based on an information-theoretic formulation of the problem, in which the transmitter and the mutually independent multiple client receivers communicate over quasi-static Rayleigh fading channels and an eavesdropper observes their transmissions through another quasi-static Rayleigh fading channel, we define the secrecy-sum capacity in terms of secure outage probability. Moreover, we also present a formulation of ergodic perfect secrecy multicast capacity at which the eavesdropper is unable to decode any information.
We consider a single-input multiple-output (SIMO) Rayleigh fading broadcast channel, where the transmitter sends some confidential information to one user which is a legitimate receiver in the presence of multiple eavesdroppers. The eavesdroppers are mutually independent and perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while insuring that each eavesdropper gets zero bits of information. Here, we find the probability of non-zero secrecy mutual information and secure outage probability to investigate the outage behavior of proposed model. We also present a formulation of ergodic secrecy mutual information in the presence of multiple eavesdroppers.
We consider the secure transmission of information over Rayleigh fading wiretap channel when the main and eavesdropper channels are correlated there. Assuming that before transmission the transmitter knows the full channel state information (CSI) of both the main and eavesdropper channels, we analyze the average secrecy capacity with limited signal-to-noise ratio (SNR), for which a simple closed-form expression is derived based on the typical Marcum Q function. This is achieved by exploring the symmetry property between the main channel and eavesdropper channel to avoid a complicated integration involved in the secrecy capacity analysis, such that the secrecy capacity derivation can be significantly simplified. Numerical results are also provided to confirm our analytical ones.