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 Transactions on Vehicular Technology

Optimizing Training and Transmission Overheads for Secure URLLC Against Randomly Distributed Eavesdroppers

Yuncong Xie, Pinyi Ren

Published Jul 26, 2022• 10 citations
Publisher

Abstract

In this article, we focus on the pilot-assisted transmission design for secure ultra-reliable and low-latency communication (URLLC) systems, which has not yet been studied in the existing literatures. In each transmission period of this system, the multi-antenna controller sends confidential URLLC messages integrated with artificial noise (AN) to a single-antenna actuator for some mission-critical operations (e.g., remote control), and while an unknown number of passive eavesdroppers attempt to intercept this confidential message in a non-colluding manner. Since the conventional ergodic secrecy capacity is not accurate to describe the maximal achievable secrecy rate of URLLC with short blocklength coding, we establish the concept of achievable effective secrecy rate (AESR) to measure the secrecy performance of our URLLC system, which is defined as the average number of information bits can be transmitted per channel use under given reliability and information leakage constraints. Due to the exact expression of AESR has an intractable form, we derive a closed-form approximation on the AESR to simplify the calculation, via leveraging the Laplace approximation and Gaussian-Chebyshev quadrature method. Following by this approximation, we propose an efficient two-dimensional search algorithm to determine the optimal transmission parameters that maximize the AESR, i.e., the training pilot length and the power allocation ratio between confidential data signals and AN. Furthermore, the asymptotic performance of AESR in the high-SNR regime is also analyzed to gain more insights. Numerical results validate the accuracy of theoretical approximations presented in this paper, and illustrate how the particular system parameters impact the AESR of our considered URLLC system.

DOI
10.1109/tvt.2022.3194054

Related papers

Security-Oriented Pilot and Data Transmission for URLLC in Mission-Critical IoT Scenarios

Yuncong Xie, Pinyi Ren, Dongyang Xu

In this article, we focus on the joint design of channel training and data transmission for secure ultrareliable and low-latency communications (URLLCs) in mission-critical Internet of Things (IoT) scenarios, e.g., intelligent transportation and remote control. Specifically, we consider a multiple-input multiple-output multiantenna eavesdropper (MIMOME) system, and the role of artificial noise (AN) for securing URLLC in this system is studied. In the channel training phase, we use the two-way discriminatory channel estimation (DCE) protocol with AN injection to suppress the channel estimation accuracy at eavesdropper. Meanwhile, the AN-assisted secrecy beamforming scheme is adopted to mask the confidential data signals. Following by the security enhancements above, we provide a quantitative definition of achievable effective secrecy rate (AESR) to measure the performance of our URLLC system with imperfect channel state information (CSI) and short-packet feature. Then, a nonasymptotic closed-form lower bound of AESR is provided to make the numerical calculation tractable, and the asymptotic system performance in the high-SNR regime is also studied to gain a comprehensive insight. Based on the cyclic coordinated search method, we propose an iterative resource allocation algorithm to maximize the AESR of our system, where the blocklength and transmit power assigned to the reverse/forward pilots, confidential data signals, and AN are jointly optimized. In addition, numerical results reveal the AESR performance of our URLLC system for different system parameters, and demonstrate the convergence and superiority of our proposed algorithm.

IEEE Internet of Things Journal•Mar 29, 2023•7 citations

Secrecy analysis of short-packet transmissions in ultra-reliable and low-latency communications

Jianhua He, Guangheng Zhao, Lu Wang +2 more

Abstract In this paper, we investigate the secrecy performance of short-packet transmissions in ultra-reliable and low-latency communications (URLLC). We consider the scenario where a multi-antenna source communicates with a single-antenna legitimate receiver requiring ultra-high reliability and low latency, in the presence of a single-antenna eavesdropper. In order to safeguard URLLC, the source transmits the artificial noise (AN) signal together with the confidential signal to confuse the eavesdropper. We adopt a lower bound on the maximal secrecy rate as the secrecy performance metric for short-packet transmissions in URLLC, which takes the target decoding error probabilities at the legitimate receiver and the eavesdropper into account. Using this metric, we first derive a compact expression of the generalized secrecy outage probability (SOP). Then, we formally prove that the generalized SOP is a convex function with respect to the power allocation factor between the confidential signal and the AN signal. We further determine the optimal power allocation factor that minimizes the generalized SOP. The results presented in this work can be useful for designing new secure transmission schemes for URLLC.

EURASIP Journal on Wireless Communications and Networking•Feb 15, 2021•4 citations

Secrecy Outage Analysis of Pilot-Assisted URLLC Systems With Randomly Distributed Eavesdroppers

Yuncong Xie, Tiantian Zhang, Pinyi Ren

In this letter, we focus on the secrecy outage analysis of ultra-reliable low-latency communication (URLLC) systems in the presence of randomly located eavesdroppers and imperfect channel state information (CSI). To be specific, the secrecy outage probability (SOP) of pilot-assisted URLLC system is investigated, which is defined as the probability that either the reliability const-raint or the secrecy constraint cannot be satisfied when the packet is delivered with a target data rate and blocklength. In fact, the definition of SOP in URLLC scenarios with short-packet feature is evidently different from that in the infinite blocklength regime. Inspired by this, we first propose a novel analytical framework to approximate the SOP in a tractable manner. Then, the asymptotic behaviours of SOP in the high-SNR and large-antenna cases are also analyzed to gain a comprehensive insight. Numerical results illustrate how the SOP of our pilot-assisted URLLC system varies with specific transmission parameters.

IEEE Communications Letters•Feb 6, 2023•4 citations

Security and Reliability Performance Analysis for URLLC With Randomly Distributed Eavesdroppers

Yuncong Xie, Pinyi Ren, Dongyang Xu +1 more

This paper for the first time investigate the security and reliability performance of ultra-reliable low-latency communication (URLLC) systems in the presence of randomly distributed eavesdroppers, where the impact of short blocklength codes and imperfect channel estimation are jointly considered. Based on the finite-blocklength information theory, we first derive a closed-form approximation of transmission error probability to describe the degree of reliability loss. Then, we also derive an asymptotic expression of intercept probability to characterize the security performance, where the impact of secrecy protected zone is also considered. Simulation and numerical results validate the accuracy of theoretical approximations, and illustrate the tradeoff between security and reliability. That is, the intercept probability of URLLC systems can be suppressed by loosening the reliability requirement, and vice versa. More importantly, the theoretical analysis and methodologies presented in this paper can offer some insights and design guidelines for supporting secure URLLC applications in the future 6G wireless networks.

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

Secrecy Throughput Enhancement with ANECE and Multi-Antenna Beamforming in Finite Blocklength

Ishmam Zabir, Ananthram Swami, Yingbo Hua

This paper presents a secure downlink communication system where a transmitter with multiple antennas sends information to multiple single antenna users under ultra reliable and low-latency communication (uRLLC) system requirement. To meet uRLLC requirement and provide secrecy against multi-antenna eavesdropper (Eve), transmitter adopts a special channel training scheme called anti-eavesdropping channel estimation (ANECE) as well as a standard transmit beamforming to send secret information in short blocklength regime. Using ANECE, two or more cooperative full-duplex radio devices obtain their receive channel state information (CSI) with respect to each other while preventing Eve from obtaining a consistent estimate of its receive CSI, which improves the secrecy of subsequent transmission of information between the devices. We derive an expression for the average secrecy throughput (AST) of ANECE assisted transmission. This easy-to-evaluate expression of approximated AST in terms of blocklength and various controllable parameters leads to useful insights to maximize AST under uRLLC requirement. Finally, numerical results are presented and discussed.

International Conference on Communications•May 16, 2022•1 citation

Achieving Covertness and Security in Broadcast Channels With Finite Blocklength

Chao Wang, Zan Li, Haibin Zhang +2 more

Considering multi-user downlink ultra-high reliability and low latency communications (URLLC), this paper employs the artificial noise (AN) technique to establish a secure and covert broadcast communication paradigm for the first time. Specifically, a multi-antenna transmitter (Alice) broadcasts the confidential information to multiple legitimate users in the presence of a multi-antenna malicious warden (Willie) and a multi-antenna eavesdropper (Eve). It is well known that AN is an effective technique for securing the physical layer security (PLS) of signal transmissions. Nevertheless, AN emission also exposes the signal transmission and decreases the signal covertness. Taking into account the impact of short-packet URLLC transmissions, we investigate the joint optimization of the precoder and AN to maximize the secrecy rate under the covertness constraint. Although the considered problem is nonconvex, we propose a branch-reduce-and-bound (BRB)-based algorithm to solve it optimally. However, the nested-loop structure of the BRB-based algorithm incurs a high computational complexity. To strike a balance between the performance and computational complexity, we also propose a low-complexity penalty successive convex approximation (SCA)-based algorithm, whose performance approaches that of the optimal BRB-based algorithm, particularly in the low to medium transmit power regime. Simulation results demonstrate the excellent performance of our proposed optimization algorithms compared with various benchmark algorithms and unveil the importance of exploiting AN for secrecy provisioning.

IEEE Transactions on Wireless Communications•Mar 23, 2022•72 citations
In this article, we focus on the pilot-assisted transmission design for secure ultra-reliable and low-latency communication (URLLC) systems, which has not yet been studied in the existing literatures. In each transmission period of this system, the multi-antenna controller sends confidential URLLC messages integrated with artificial noise (AN) to a single-antenna actuator for some mission-critical operations (e.g., remote control), and while an unknown number of passive eavesdroppers attempt to intercept this confidential message in a non-colluding manner. Since the conventional ergodic secrecy capacity is not accurate to describe the maximal achievable secrecy rate of URLLC with short blocklength coding, we establish the concept of achievable effective secrecy rate (AESR) to measure the secrecy performance of our URLLC system, which is defined as the average number of information bits can be transmitted per channel use under given reliability and information leakage constraints. Due to the exact expression of AESR has an intractable form, we derive a closed-form approximation on the AESR to simplify the calculation, via leveraging the Laplace approximation and Gaussian-Chebyshev quadrature method. Following by this approximation, we propose an efficient two-dimensional search algorithm to determine the optimal transmission parameters that maximize the AESR, i.e., the training pilot length and the power allocation ratio between confidential data signals and AN. Furthermore, the asymptotic performance of AESR in the high-SNR regime is also analyzed to gain more insights. Numerical results validate the accuracy of theoretical approximations presented in this paper, and illustrate how the particular system parameters impact the AESR of our considered URLLC system.
In this article, we focus on the joint design of channel training and data transmission for secure ultrareliable and low-latency communications (URLLCs) in mission-critical Internet of Things (IoT) scenarios, e.g., intelligent transportation and remote control. Specifically, we consider a multiple-input multiple-output multiantenna eavesdropper (MIMOME) system, and the role of artificial noise (AN) for securing URLLC in this system is studied. In the channel training phase, we use the two-way discriminatory channel estimation (DCE) protocol with AN injection to suppress the channel estimation accuracy at eavesdropper. Meanwhile, the AN-assisted secrecy beamforming scheme is adopted to mask the confidential data signals. Following by the security enhancements above, we provide a quantitative definition of achievable effective secrecy rate (AESR) to measure the performance of our URLLC system with imperfect channel state information (CSI) and short-packet feature. Then, a nonasymptotic closed-form lower bound of AESR is provided to make the numerical calculation tractable, and the asymptotic system performance in the high-SNR regime is also studied to gain a comprehensive insight. Based on the cyclic coordinated search method, we propose an iterative resource allocation algorithm to maximize the AESR of our system, where the blocklength and transmit power assigned to the reverse/forward pilots, confidential data signals, and AN are jointly optimized. In addition, numerical results reveal the AESR performance of our URLLC system for different system parameters, and demonstrate the convergence and superiority of our proposed algorithm.
Abstract In this paper, we investigate the secrecy performance of short-packet transmissions in ultra-reliable and low-latency communications (URLLC). We consider the scenario where a multi-antenna source communicates with a single-antenna legitimate receiver requiring ultra-high reliability and low latency, in the presence of a single-antenna eavesdropper. In order to safeguard URLLC, the source transmits the artificial noise (AN) signal together with the confidential signal to confuse the eavesdropper. We adopt a lower bound on the maximal secrecy rate as the secrecy performance metric for short-packet transmissions in URLLC, which takes the target decoding error probabilities at the legitimate receiver and the eavesdropper into account. Using this metric, we first derive a compact expression of the generalized secrecy outage probability (SOP). Then, we formally prove that the generalized SOP is a convex function with respect to the power allocation factor between the confidential signal and the AN signal. We further determine the optimal power allocation factor that minimizes the generalized SOP. The results presented in this work can be useful for designing new secure transmission schemes for URLLC.
In this letter, we focus on the secrecy outage analysis of ultra-reliable low-latency communication (URLLC) systems in the presence of randomly located eavesdroppers and imperfect channel state information (CSI). To be specific, the secrecy outage probability (SOP) of pilot-assisted URLLC system is investigated, which is defined as the probability that either the reliability const-raint or the secrecy constraint cannot be satisfied when the packet is delivered with a target data rate and blocklength. In fact, the definition of SOP in URLLC scenarios with short-packet feature is evidently different from that in the infinite blocklength regime. Inspired by this, we first propose a novel analytical framework to approximate the SOP in a tractable manner. Then, the asymptotic behaviours of SOP in the high-SNR and large-antenna cases are also analyzed to gain a comprehensive insight. Numerical results illustrate how the SOP of our pilot-assisted URLLC system varies with specific transmission parameters.
This paper for the first time investigate the security and reliability performance of ultra-reliable low-latency communication (URLLC) systems in the presence of randomly distributed eavesdroppers, where the impact of short blocklength codes and imperfect channel estimation are jointly considered. Based on the finite-blocklength information theory, we first derive a closed-form approximation of transmission error probability to describe the degree of reliability loss. Then, we also derive an asymptotic expression of intercept probability to characterize the security performance, where the impact of secrecy protected zone is also considered. Simulation and numerical results validate the accuracy of theoretical approximations, and illustrate the tradeoff between security and reliability. That is, the intercept probability of URLLC systems can be suppressed by loosening the reliability requirement, and vice versa. More importantly, the theoretical analysis and methodologies presented in this paper can offer some insights and design guidelines for supporting secure URLLC applications in the future 6G wireless networks.
This paper presents a secure downlink communication system where a transmitter with multiple antennas sends information to multiple single antenna users under ultra reliable and low-latency communication (uRLLC) system requirement. To meet uRLLC requirement and provide secrecy against multi-antenna eavesdropper (Eve), transmitter adopts a special channel training scheme called anti-eavesdropping channel estimation (ANECE) as well as a standard transmit beamforming to send secret information in short blocklength regime. Using ANECE, two or more cooperative full-duplex radio devices obtain their receive channel state information (CSI) with respect to each other while preventing Eve from obtaining a consistent estimate of its receive CSI, which improves the secrecy of subsequent transmission of information between the devices. We derive an expression for the average secrecy throughput (AST) of ANECE assisted transmission. This easy-to-evaluate expression of approximated AST in terms of blocklength and various controllable parameters leads to useful insights to maximize AST under uRLLC requirement. Finally, numerical results are presented and discussed.
Considering multi-user downlink ultra-high reliability and low latency communications (URLLC), this paper employs the artificial noise (AN) technique to establish a secure and covert broadcast communication paradigm for the first time. Specifically, a multi-antenna transmitter (Alice) broadcasts the confidential information to multiple legitimate users in the presence of a multi-antenna malicious warden (Willie) and a multi-antenna eavesdropper (Eve). It is well known that AN is an effective technique for securing the physical layer security (PLS) of signal transmissions. Nevertheless, AN emission also exposes the signal transmission and decreases the signal covertness. Taking into account the impact of short-packet URLLC transmissions, we investigate the joint optimization of the precoder and AN to maximize the secrecy rate under the covertness constraint. Although the considered problem is nonconvex, we propose a branch-reduce-and-bound (BRB)-based algorithm to solve it optimally. However, the nested-loop structure of the BRB-based algorithm incurs a high computational complexity. To strike a balance between the performance and computational complexity, we also propose a low-complexity penalty successive convex approximation (SCA)-based algorithm, whose performance approaches that of the optimal BRB-based algorithm, particularly in the low to medium transmit power regime. Simulation results demonstrate the excellent performance of our proposed optimization algorithms compared with various benchmark algorithms and unveil the importance of exploiting AN for secrecy provisioning.