2020 IEEE 31st Annual International Symposium on Personal, Indoor and Mobile Radio Communications 2020
DOI: 10.1109/pimrc48278.2020.9217327
|View full text |Cite
|
Sign up to set email alerts
|

Average Secrecy Throughput Analysis with Multiple Eavesdroppers in the Finite Blocklength

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…It is assumed that the service time of each status update packet is independent and equally distributed. According to literature [8], under the premise of ensuring the service quality of each service, the cumulative service time obeys the upper bound constraint ( ( ), ( ))…”
Section:   mentioning
confidence: 99%
“…It is assumed that the service time of each status update packet is independent and equally distributed. According to literature [8], under the premise of ensuring the service quality of each service, the cumulative service time obeys the upper bound constraint ( ( ), ( ))…”
Section:   mentioning
confidence: 99%
“…The performance parameters and analysis framework proposed in [5] have been extended to the short-packet communication scenario with multiple eavesdroppers by [6]. In this work, the impact of the number of eavesdroppers on the security performance of a short-packet system is investigated.…”
Section: A Ergodic-based Performance Metricmentioning
confidence: 99%
“…In this work, the impact of the number of eavesdroppers on the security performance of a short-packet system is investigated. The evaluation in [6] shows that the average secrecy output decreases with the number of eavesdroppers, resulting in a lower average secrecy throughput. The abovementioned works have established corresponding performance evaluation parameters and analysis frameworks with the conclusion of secure short-packet information theory, and provide feasible solutions for secure performance analysis of actual FB-CSs.…”
Section: A Ergodic-based Performance Metricmentioning
confidence: 99%