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:1903.01433 · IEEE Transactions on Wireless Communications

Secure Short-Packet Communications for Mission-Critical IoT Applications

Hui‐Ming Wang, Qian Yang, Zhiguo Ding, H. Vincent Poor

Published Mar 20, 2019• 195 citations
arXivHTMLPDF

Abstract

In applications of the Internet of Things (IoT), the use of short packets is expected to meet the stringent latency requirement in ultra-reliable low-latency communications; however, the incurred security issues and the impact of finite blocklength coding on the physical-layer security are not well understood. This paper investigates the performance of secure short-packet communications in a mission-critical IoT system with an external multi-antenna eavesdropper. An analytical framework is proposed to approximate the average achievable secrecy throughput of the system with finite blocklength coding. To gain more insight, a simple case with a single-antenna access point (AP) is considered first, in which the secrecy throughput is approximated in a closed form. Based on that result, the optimal blocklengths to maximize the secrecy throughput with and without the reliability and latency constraints, respectively, are derived. For the case with a multi-antenna AP, following the proposed analytical framework, closed-form approximations for the secrecy throughput are obtained under both beamforming and artificial-noise-aided transmission schemes. The numerical results verify the accuracy of the proposed approximations and illustrate the impact of the system parameters on the tradeoff between transmission latency and reliability under a secrecy constraint.

DOI
10.1109/twc.2019.2904968

Related papers

Multi-Antenna Jammer-Assisted Secure Short Packet Communications in IoT Networks

Dechuan Chen, Jin Li, Jianwei Hu +2 more

In this work, we exploit a multi-antenna cooperative jammer to enable secure short packet communications in Internet of Things (IoT) networks. Specifically, we propose three jamming schemes to combat eavesdropping, i.e., the zero forcing beamforming (ZFB) scheme, null-space artificial noise (NAN) scheme, and transmit antenna selection (TAS) scheme. Assuming Rayleigh fading, we derive new closed-form approximations for the secrecy throughput with finite blocklength coding. To gain further insights, we also analyze the asymptotic performance of the secrecy throughput in the case of infinite blocklength. Furthermore, we investigate the optimization problem in terms of maximizing the secrecy throughput with the latency and reliability constraints to determine the optimal blocklength. Simulation results validate the accuracy of the approximations and evaluate the impact of key parameters such as the jamming power and the number of antennas at the jammer on the secrecy throughput.

Future Internet•Sep 26, 2023•1 citation

Secure Downlink Transmission in the Internet of Things: How Many Antennas Are Needed?

Jianwei Hu, Nan Yang, Yueming Cai

Physical layer security is a promising way to secure the wireless communications in the Internet of Things (IoT). Motivated by the fact that the limited feedback resources in the IoT network would degrade the secrecy advantage of the multiple-antenna technique, we attempt to investigate the problem of how many transmit antennas should be utilized to perform secure communications. In particular, we consider the heterogeneous IoT downlink network and design a multiuser secure transmission scheme. In this scheme, the zero-forcing beamforming technique is adopted to serve the IoT legitimate users, and the remaining spatial freedoms are utilized to send artificial noise (AN) for confusing the passive eavesdroppers. Given the secrecy outage constraints, we derive the closed-form expression for the network secrecy throughput and formulate a non-convex optimization problem with multiple parameters, e.g., the number of transmit antennas, the wiretap codes, the feedback bits allocation strategy, and the power allocation ratio between the information bearing signal and the AN. To effectively tackle this problem, we develop an optimization framework involving the block coordinate descent algorithm and the 1-D search method. Simulation results validate the effectiveness of our proposed optimization framework and show that the optimal number of transmit antennas increases as the secrecy outage constraints become stricter, or the feedback resources become scarcer.

IEEE Journal on Selected Areas in Communications•Apr 11, 2018•27 citations

Secure Short-Packet Multihop Communications with Friendly Jammers

Toan-Van Nguyen, Thai-Hoc Vu, Daniel Benevides da Costa +1 more

In this paper, we propose a best node and friendly jammer (bN-fJ) scheme for secure short-packet multi-hop communications in Internet-of-Things (IoT) networks. Under imperfect channel state information (CSI) conditions, the best IoT node is chosen for data transmission and a friendly jammer is chosen later to confuse the received signals at a multi-antenna eavesdropper. Approximate and asymptotic closed-form expressions for the secrecy throughput of the bN-fJ scheme are obtained, offering valuable insights into the system designs. Numerical results show that the proposed bN-fJ scheme achieves much better performance than benchmarking schemes, especially with 1 more bit/channel use and 9.4 dB enhancement in communication reliability measure. Moreover, under imperfect CSI and large antennas at the eavesdropper, the secrecy throughput and communication reliability of the system can be improved by employing the proposed node selection, e.g., a 12.5 dB improvement at 10 antennas at Eve and the imperfect CSI of 0.8. Finally, the secrecy throughput is presented as a concave curve for the number of hops and blocklengths, which enables us to identify the optimal hops and blocklength for secure multi-hop short-packet transmissions.

Globecom•Dec 8, 2024•1 citation

Secure Short Packet Communication With Energy Harvesting Self-Sustaining Nodes

Amit Patel, Shankar Prakriya

This letter studies the secrecy performance of short packet communication between a multi-antenna wireless-powered node and a single-antenna destination in the presence of a passive multi-antenna eavesdropper. An approximate closed-form expression for secrecy throughput (ST) with transmit antenna selection is derived, thereby showing the impact of key parameters on ST. Specifically, we demonstrate how the optimal blocklength can be evaluated for the proposed system. Besides, we derive an expression for the optimal fraction of blocklength for energy harvesting, i.e., harvest blocklength, with a single-antenna source and a multi-antenna eavesdropper. Numerical results illustrate the impact of system parameters on optimal harvest blocklength at both low and high signal-to-noise ratios.

IEEE Wireless Communications Letters•Nov 13, 2025•0 citations

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

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
In applications of the Internet of Things (IoT), the use of short packets is expected to meet the stringent latency requirement in ultra-reliable low-latency communications; however, the incurred security issues and the impact of finite blocklength coding on the physical-layer security are not well understood. This paper investigates the performance of secure short-packet communications in a mission-critical IoT system with an external multi-antenna eavesdropper. An analytical framework is proposed to approximate the average achievable secrecy throughput of the system with finite blocklength coding. To gain more insight, a simple case with a single-antenna access point (AP) is considered first, in which the secrecy throughput is approximated in a closed form. Based on that result, the optimal blocklengths to maximize the secrecy throughput with and without the reliability and latency constraints, respectively, are derived. For the case with a multi-antenna AP, following the proposed analytical framework, closed-form approximations for the secrecy throughput are obtained under both beamforming and artificial-noise-aided transmission schemes. The numerical results verify the accuracy of the proposed approximations and illustrate the impact of the system parameters on the tradeoff between transmission latency and reliability under a secrecy constraint.
In this work, we exploit a multi-antenna cooperative jammer to enable secure short packet communications in Internet of Things (IoT) networks. Specifically, we propose three jamming schemes to combat eavesdropping, i.e., the zero forcing beamforming (ZFB) scheme, null-space artificial noise (NAN) scheme, and transmit antenna selection (TAS) scheme. Assuming Rayleigh fading, we derive new closed-form approximations for the secrecy throughput with finite blocklength coding. To gain further insights, we also analyze the asymptotic performance of the secrecy throughput in the case of infinite blocklength. Furthermore, we investigate the optimization problem in terms of maximizing the secrecy throughput with the latency and reliability constraints to determine the optimal blocklength. Simulation results validate the accuracy of the approximations and evaluate the impact of key parameters such as the jamming power and the number of antennas at the jammer on the secrecy throughput.
Physical layer security is a promising way to secure the wireless communications in the Internet of Things (IoT). Motivated by the fact that the limited feedback resources in the IoT network would degrade the secrecy advantage of the multiple-antenna technique, we attempt to investigate the problem of how many transmit antennas should be utilized to perform secure communications. In particular, we consider the heterogeneous IoT downlink network and design a multiuser secure transmission scheme. In this scheme, the zero-forcing beamforming technique is adopted to serve the IoT legitimate users, and the remaining spatial freedoms are utilized to send artificial noise (AN) for confusing the passive eavesdroppers. Given the secrecy outage constraints, we derive the closed-form expression for the network secrecy throughput and formulate a non-convex optimization problem with multiple parameters, e.g., the number of transmit antennas, the wiretap codes, the feedback bits allocation strategy, and the power allocation ratio between the information bearing signal and the AN. To effectively tackle this problem, we develop an optimization framework involving the block coordinate descent algorithm and the 1-D search method. Simulation results validate the effectiveness of our proposed optimization framework and show that the optimal number of transmit antennas increases as the secrecy outage constraints become stricter, or the feedback resources become scarcer.
In this paper, we propose a best node and friendly jammer (bN-fJ) scheme for secure short-packet multi-hop communications in Internet-of-Things (IoT) networks. Under imperfect channel state information (CSI) conditions, the best IoT node is chosen for data transmission and a friendly jammer is chosen later to confuse the received signals at a multi-antenna eavesdropper. Approximate and asymptotic closed-form expressions for the secrecy throughput of the bN-fJ scheme are obtained, offering valuable insights into the system designs. Numerical results show that the proposed bN-fJ scheme achieves much better performance than benchmarking schemes, especially with 1 more bit/channel use and 9.4 dB enhancement in communication reliability measure. Moreover, under imperfect CSI and large antennas at the eavesdropper, the secrecy throughput and communication reliability of the system can be improved by employing the proposed node selection, e.g., a 12.5 dB improvement at 10 antennas at Eve and the imperfect CSI of 0.8. Finally, the secrecy throughput is presented as a concave curve for the number of hops and blocklengths, which enables us to identify the optimal hops and blocklength for secure multi-hop short-packet transmissions.
This letter studies the secrecy performance of short packet communication between a multi-antenna wireless-powered node and a single-antenna destination in the presence of a passive multi-antenna eavesdropper. An approximate closed-form expression for secrecy throughput (ST) with transmit antenna selection is derived, thereby showing the impact of key parameters on ST. Specifically, we demonstrate how the optimal blocklength can be evaluated for the proposed system. Besides, we derive an expression for the optimal fraction of blocklength for energy harvesting, i.e., harvest blocklength, with a single-antenna source and a multi-antenna eavesdropper. Numerical results illustrate the impact of system parameters on optimal harvest blocklength at both low and high signal-to-noise ratios.
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.
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.