 Research
 Open Access
 Published:
Secrecy analysis of shortpacket transmissions in ultrareliable and lowlatency communications
EURASIP Journal on Wireless Communications and Networking volume 2021, Article number: 29 (2021)
Abstract
In this paper, we investigate the secrecy performance of shortpacket transmissions in ultrareliable and lowlatency communications (URLLC). We consider the scenario where a multiantenna source communicates with a singleantenna legitimate receiver requiring ultrahigh reliability and low latency, in the presence of a singleantenna 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 shortpacket 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.
Introduction
Supporting ultrareliable and lowlatency communications (URLLC) is one of the major goals in the fifth generation (5G) and future wireless networks [1, 2], due to the requirements of various emerging applications, such as smart city, missioncritical internetofthings, and vehicletovehicle communications [3, 4]. However, the complicated propagation environment (e.g., path loss, shadowing, and fast fading) in wireless networks makes it very difficult to satisfy the strict qualityofservice (QoS) requirements on endtoend (E2E) delay (e.g., 1 ms) and reliability (e.g., \(10^{7}\) packet loss probability) [5]. Against this background, significant research efforts have been devoted to fulfill the QoS requirements of URLLC in wireless networks [6,7,8,9,10].
On the other hand, security is another pivotal issue in URLLC, while so far has drawn little attention. Traditionally, security in wireless communications is achieved through keybased cryptographic techniques applied on upper layers. However, with the development of wireless technology, the size of wireless networks has been expanding rapidly over the past decades, which makes the key generation, distribution, and management prohibitively expensive [11]. To tackle this problem, physical layer security has been proposed as an alternative for traditional keybased cryptography techniques, since it can ensure secure data transmissions by exploiting physical properties of wireless channels without using secret keys. Subsequently, enhancing physical layer security in wireless networks has been intensively examined [12].
However, it is very challenging to ensure the security of URLLC with the existing physical layer security techniques. This is mainly because how to evaluate the secrecy performance of URLLC remains an open problem. Specifically, the existing physical layer security schemes are commonly designed based on the classical informationtheoretic secrecy,^{Footnote 1} the key assumption of which is that the transmissions can be errorfree and the information leaked to the eavesdropper vanishes as the blocklength of channel codes goes to infinity. This assumption enables the use of secrecy performance metrics, such as the achievable secrecy rate and the secrecy outage probability (SOP), to characterize the secrecy performance of wireless communication systems. However, in URLLC, the blocklength of channel codes is short, which means the transmissions are no longer errorfree and the information leaked to the eavesdropper cannot be vanished. It follows that the classical informationtheoretic secrecy is not achievable, and thereby the secrecy performance metrics commonly adopted in the existing physical layer security schemes cannot be utilized to characterize the secrecy performance of URLLC.
Motivated by these observations, most recently, physical layer security of shortpacket transmissions in URLLC has been receiving increasing research attention [13, 14]. In [13], a bound on the equivocation rate of relay wiretap channels with finite blocklength was derived, assuming that the eavesdropper can decode its received signal with an arbitrary small number of errors, which is less likely to be valid in practice. In [14], the secrecy throughput of URLLC was investigated, and the optimal block length that maximizes the secrecy throughput was examined. Different from [13, 14], in this work, we take both the decoding error probability at the legitimate receiver and the decoding error probability at the eavesdropper into consideration, and adopt a lower bound on the maximal secrecy rate of shortpacket transmissions in URLLC derived in [15, 16] as the performance metric. Utilizing this metric, we derive the generalized SOP that the lower bound is less than a certain threshold. Moreover, we consider that the source transmits the artificial noise (AN) signal together with the confidential signal, and show how the secrecy performance of URLLC can be enhanced by judiciously selecting the power allocation factor between the confidential signal and the AN signal.
Methods
System model
We consider URLLC in a wiretap channel, where an \(N_{\text {s}}\)antenna source transmits to a singleantenna legitimate receiver with ultrahigh reliability and low latency, in the presence of a singleantenna eavesdropper. We denote \({{\mathbf {h}}}_{\text {sr}}\) and \({{\mathbf {h}}}_{\text {se}}\) as the \(1\times N_{\text {s}}\) channel vectors from the source to the legitimate receiver and from the source to the eavesdropper, respectively. We assume that all the channels are subject to quasistatic independent and identical (i.i.d) Rayleigh fading with a finite blocklength L, i.e., the channels remain the same within a fading block. We further assume that the source can acquire the instantaneous channel state information (CSI) of the main channel from the source to the legitimate receiver through trainingbased channel estimation, while only statistical CSI from the eavesdropper is known to the source.
To safeguard URLLC, the source transmits the AN signal together with the confidential signal in order to confuse the eavesdropper. As such, the transmitted signal at the source can be expressed as
where \({\mathbf {w}}_{\text {s}}\) denotes the \(N_{\text {s}}\times 1\) vector used for transmitting the confidential signal scalar \(t_{\text {s}}\), and \({\mathbf {W}}_{\text {AN}}\) denotes the \(N_{\text {s}}\times (N_{\text {s}}1)\) matrix used for transmitting the AN signal vector \({\mathbf {t}}_{\text {AN}}\). We define \(\alpha\), \(0<\alpha \le 1\), as the fraction of power allocated for transmitting the confidential signal. Then, we have \({\mathbb {E}}\left[ t_{\text {s}}^2\right] =\alpha\) and \({\mathbb {E}}\left[ t_{\text {AN}}t_{\text {AN}}^H\right] =\frac{1\alpha }{N_{\text {s}}1}{\mathbf {I}}_{N_{\text {s}}1}\). In addition, we choose \({\mathbf {w}} = \frac{{{\mathbf {h}}}_{\text {sr}}^H}{\Vert {{\mathbf {h}}}_{\text {sr}}\Vert }\) and \({\mathbf {W}}_{\text {AN}}\) as the projection matrix into the null space of \({{\mathbf {h}}}_{\text {sr}}\). By doing so, the link quality of the eavesdropper can be degraded, while the link quality of the legitimate receiver is not affected.
Based on (1), we express the received signals at the legitimate receiver and the eavesdropper, respectively, as
where \(P_{\text {s}}\) denotes the transmit power of the source, \(d_{\text {sr}}\) and \(d_{\text {se}}\) denote the distance from the source to the legitimate receiver and the distance from the source to the eavesdropper, respectively, \(\eta\) denotes the path loss exponent, \(n_b\) and \(n_e\) denotes the thermal noise at the legitimate receiver and the eavesdropper, respectively, which are assumed to be complex Gaussian distributed random variables with zero mean and variances \(\sigma _b^2\) and \(\sigma _e^2\).
According to (2) and (3), we now characterize the achievable rates of the legitimate receiver and the eavesdropper. Note that, due to the shortpacket transmissions in URLLC, it is difficult to obtain the closedform expressions of the achievable rates of the legitimate receiver and the eavesdropper. However, they can be accurately approximated, respectively, as [17]
where \(C\left( \gamma \right) =\log _2\left( 1+\gamma \right)\) and \(V\left( \gamma \right) = (\log _2(e))^2(1{1}\Big /{{{\left( 1 + \gamma \right) }^2}})\), \(\varepsilon _{\text {sr}}\) and \(\varepsilon _{\text {se}}\) denotes the target decoding error probabilities of the legitimate receiver and the eavesdropper, respectively, and \(f_{\text {Q}}^{  1}\) denotes the inverse Qfunction. In (4) and (5), \(\gamma _{\text {sr}} = \alpha \overline{\gamma }_{\text {sr}}\Vert {\mathbf {h}}_{\text {sr}}\Vert ^2\) and \(\gamma _{\text {se}} = \frac{\alpha \overline{\gamma }_{\text {se}}\Vert {\mathbf {h}}_{\text {se}}{\mathbf {w}}_{\text {s}}\Vert ^2}{\frac{1\alpha }{N_{\text {s}}1}\overline{\gamma }_{\text {se}}\Vert {\mathbf {h}}_{\text {sr}}{\mathbf {W}}_{\text {AN}}\Vert ^2+1}\), where \(\overline{\gamma }_{\text {sr}} = {P_{\text {s}}d_{\text {sr}}^{\eta }}/{\sigma _b^2}\) and \(\overline{\gamma }_{\text {se}} = {P_{\text {s}}d_{\text {se}}^{\eta }}/{\sigma _e^2}\).
The source needs to transmit a packet with \(b_r\) bits to the legitimate receiver with transmission delay \(\tau\), which equals to the transmission duration. In addition, the decoding error probability at the legitimate receiver should not exceed \(\varepsilon _{\max }\) such that the legitimate receiver’s requirement on the reliability can be satisfied. As such, we have
where W denotes the bandwidth for data transmission. Substituting (4) into (6), we obtain that, in order to fulfill the requirements of URLLC on the decoding error probability and the latency at the legitimate receiver, the average SNR in the main channel should satisfy
where \(\Psi \left( b_r,\varepsilon _{\text {sr}},L\right) = {\left( \frac{b_r}{L} +\frac{f_{\text {Q}}^{  1}\left( \varepsilon _{\text {sr}}\right) }{\ln 2\sqrt{L}}\right) }\). In (7), we apply the equality that \(\tau W = L\) and the approximation that \(V\left( \gamma _{\text {sr}}\right) \approx \frac{1}{\ln 2}\) when \(\gamma _{\text {sr}}\) is relatively large (e.g., \(\gamma _{\text {sr}} = 10\) dB), which can be easily achieved in wireless networks for supporting URLLC. According to (7), the source needs to adaptively adjust its transmit power based on the smallscale fading in the main channel such that URLLC can be supported.
Secrecy performance analysis
In this section, we characterize the secrecy performance of URLLC in our system. Specifically, we first derive a lower bound on the maximal secrecy rate. Based on the derived lower bound, we then derive the generalized SOP of our system.
Secrecy performance metrics for URLLC
In this subsection, we first elaborate more on why classical informationtheoretic secrecy cannot be used to evaluate the level of secrecy in URLLC. We assume that the confidential message \({\mathcal {M}}\) is encoded into \({\mathcal {X}}^L\) at the source. We denote \({\mathcal {Y}}^L\) and \({\mathcal {Z}}^L\) as the received messages at the legitimate receiver and the eavesdropper, respectively. According to [18, 19], in order to achieve secure transmission, a wiretap code with parameter pair \(\left( R_b,R_s\right)\) needs to be used, where \(R_b\) and \(R_s\) denote the transmission rate of \({\mathcal {X}}^L\) and the target secrecy rate. In addition, we note that \(R_bR_s\) denotes the redundancy rate of the wiretap code, representing the cost of preventing the confidential message \({\mathcal {M}}\) from being eavesdropped. By using the wiretap code, classical informationtheoretic secrecy can be achieved when 1) the message \({\mathcal {M}}\) is correctly decoded at the legitimate receiver, i.e., \(R_b\le I\left( {\mathcal {M}};{\mathcal {Y}}^L\right)\), where \(I\left( X;Y\right)\) denotes the mutual information between X and Y, and the information leakage to the eavesdropper vanishes for infinite blocklength, i.e.,
However, in URLLC, the blocklength L is short. As a result, the confidential message \({\mathcal {M}}\) cannot be decoded at the legitimate receiver with an arbitrary small number of errors and the information leakage to the eavesdropper cannot be vanished. It follows that traditional secrecy performance metrics, such as the achievable secrecy rate and the SOP, cannot be directly applied to evaluate the level of secrecy in URLLC. To address this problem, we adopt a lower bound on the maximal secrecy rate (derived in [15, 16]) as the secrecy performance metric of URLLC, given by,
We note that the lower bound on the maximal secrecy rate in (9) takes both the target decoding error probabilities at the legitimate receiver and the eavesdropper, i.e., \(\varepsilon _{\text {sr}}\) and \(\varepsilon _{\text {se}}\), into consideration. We also note that \(f_{\text {Q}}^{1}\left( \varepsilon \right)\) increases as \(\varepsilon\) decreases. As such, \(\rho \left( \alpha ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\) increases as \(\varepsilon _{\text {sr}}\) and \(\varepsilon _{\text {se}}\) increase. Moreover, we note that \(\rho \left( \alpha ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\) can reduce to the classical achievable secrecy rate used in existing works on physical layer security when the blocklength \(L\rightarrow \infty\), indicating that shortpacket transmissions in URLLC will lead to the reduction in the achievable secrecy rate.
Based on (9), we can further define the generalized SOP for URLLC as the probability that the lower bound on the maximal secrecy rate is smaller than a certain threshold \(\beta\). Mathematically, it is given by
Generalized secrecy outage probability
Since the instantaneous CSI of the main channel is available at the source (i.e., \(\gamma _{\text {sr}}\) is known to the source), we consider the adaptive transmission by setting the transmission rate of the wiretap code \(R_b = R_{\text {sr}}\) (as in [20]). The generalized SOP of URLLC in our considered system can be characterized in the following theorem.
Theorem 1
The generalized SOP of URLLC in our system is given by
where \(\Phi \left( \alpha ,\beta ,R_{\text {sr}}\right) = R_{\text {sr}}\beta \frac{1}{\ln 2\sqrt{L}}f_{\text {Q}}^{  1}\left( \varepsilon _{\text {se}}\right)\).
Proof
With the aid of [20, 21], we express the cumulative probability function of \(\gamma _{\text {se}}\) as
Based on (9) and (10), we reexpress the generalized SOP as
where (a) holds by applying the approximation that \(V\left( \gamma _{\text {se}}\right) \approx (\log _2(e))^2\) when \(\gamma _{\text {se}}\) is relatively large.^{Footnote 2} Substituting (12) into (13), we obtain the desired result in (11), which completes the proof. \(\square\)
We note that (11) is accurate for arbitrary values of \(R_s\), \(\varepsilon _{\text {se}}\), and L. According to Theorem 1, several interesting observations can be made, as follows.
Remark 1
The generalized SOP decreases as \(R_{\text {sr}}\) increases. As such, For a fixed \(\varepsilon _{\text {sr}}\), efforts of enhancing the link quality in the main channel can also improve the secrecy performance of URLLC in our system.
Remark 2
The generalized SOP increases as \(\varepsilon _{\text {sr}}\) and \(\varepsilon _{\text {se}}\) decrease, implying that the secrecy performance of URLLC in our system degrades when the source and/or the eavesdropper requires a higher decoding accuracy.
Based on Theorem 1, we examine the convexity of the generalized SOP with respect to the power allocation factor \(\alpha\) in the following lemma.
Lemma 1
The generalized SOP is a convex function of the power allocation factor \(\alpha\).
Proof
In order to prove Lemma 1, we need to show that the second derivative of \(P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\) with respect to \(\alpha\) is positive. To this end, according to (11), we first express \(\frac{\partial ^2 P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right) }{\partial ^2\alpha }\) as
where
with \(\zeta \left( \alpha \right) = 2^{\Phi \left( \alpha ,\beta ,R_{\text {sr}}\right) }1\)
with \(\xi = 2^{\frac{1}{\ln 2\sqrt{L}}\left( f_{\text {Q}}^{  1}\left( \varepsilon _{\text {sr}}\right) +f_{\text {Q}}^{  1}\left( \varepsilon _{\text {se}}\right) \right) \beta }\),
and
Based on (15)–(20), we further derive \(\frac{\partial ^2 P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right) }{\partial ^2\alpha }\) as (21), shown at the top of the next page. In (21), \(\Theta \left( \alpha \right)\) and \(\Upsilon \left( \alpha \right)\) are respectively given by
Then, with some mathematical manipulations, we obtain the following inequality
Note that \(\xi <1\) and \(\Theta \left( \alpha \right) >0\), we confirm that \(\frac{\partial ^2 P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right) }{\partial ^2\alpha }>0\). The proof is completed. \(\square\)
Lemma 1 indicates that there exists a unique optimal \(\alpha ^{*}\) that minimizes the generalized SOP. Mathematically, \(\alpha ^{*}\) can be expressed as
We note that it is difficult to obtain the closedform expression of \(\alpha ^{*}\). However, \(\alpha ^{*}\) can be effectively determined by using the bisection method. Then, we define the minimum generalized SOP achieved by \(\alpha ^{*}\) as \(P_{\text {so}}^{*}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\).
Experiment
In this section, we provide numerical results to validate our analysis of the generalized SOP and examine the impacts of system parameters (e.g., \(\overline{\gamma }_{\text {sr}}\), \(\overline{\gamma }_{\text {se}}\), \(\alpha\), \(N_{\text {s}}\), and \(\varepsilon _{\text {se}}\)) on the generalized SOP. Throughout this section, the requirement on the decoding error probability at the legitimate receiver is \(10^{7}\), the packet size is 32 bytes, the transmission duration is 0.5 ms, and the bandwidth is 1 MHz [1].
We first verify the accuracy of our expression of the generalized SOP \(P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\) in Fig. 1. In this figure, we plot \(P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\) versus \(\overline{\gamma }_{\text {sr}}\) for different ratios between \(\overline{\gamma }_{\text {sr}}\) and \(\overline{\gamma }_{\text {se}}\) with \(N_{\text {s}} = 2\), \(\varepsilon _{\text {sr}} = 10^{7}\), \(\varepsilon _{\text {se}} = 10^{6}\), \(\beta = 0.5\), and \(R_s = 1\) bits/s/Hz. We can see that the analytical curves, obtained from Theorem 1, accurately match the simulation points generated from Monte Carlo simulations, demonstrating the accuracy of our analysis for \(P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\) in Theorem 1. We also see that \(P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\) decreases as \(\overline{\gamma }_{\text {sr}}\) increases, indicating that the level of secrecy in URLLC can be enhanced through increasing the transmit power at the source. Moreover, we see that \(P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\) decreases as \(\overline{\gamma }_{\text {sr}}/\overline{\gamma }_{\text {se}}\) increases.
In Fig. 2, we examine the impact of the power allocation factor between the confidential signal and the AN signal, \(\alpha\), on the secrecy performance of URLLC. In Fig. 2a, we plot \(P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\) versus \(\alpha\) for different values of \(\overline{\gamma }_{\text {sr}}/\overline{\gamma }_{\text {se}}\). We see that, for each value of \(\overline{\gamma }_{\text {sr}}/\overline{\gamma }_{\text {se}}\), \(P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\) first decreases then increases as \(\alpha\) varies from 0 to 1, and there is a unique \(\alpha ^{*}\) that minimizes \(P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\). We also see that the optimal \(\alpha ^{*}\) that achieves the minimum generalized SOP, i.e., \(P_{\text {so}}^{*}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\), increases the value of \(\overline{\gamma }_{\text {sr}}/\overline{\gamma }_{\text {se}}\) increases. This indicates that, when the eavesdropper is relatively far away from the source, transmitting the AN signal becomes less effective. In order to achieve the optimal secrecy performance, the source needs to allocate more power to the confidential signal. In Fig. 1b, we plot \(P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\) versus \(\alpha\) for different values of \(\overline{\gamma }_{\text {sr}}/\overline{\gamma }_{\text {se}}\) with \(\overline{\gamma }_{\text {sr}}/\overline{\gamma }_{\text {se}}=2\) dB. We see that the minimum generalized SOP decreases as \(N_{\text {s}}\) increases, showing that the secrecy performance of URLLC can be enhanced by deploying more antennas at the source. Moreover, we see that the optimal \(\alpha ^{*}\) that minimizes \(P_{\text {so}}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\) decreases as \(N_{\text {s}}\) increases, demonstrating that, with more antennas deploys at the source, the source can allocate less transmit power to the confidential signal and still achieve the minimum generalized SOP.
Finally, we examine the impact of the target decoding error probability at the eavesdropper, \(\varepsilon _{\text {se}}\), on the optimal power allocation factor in Fig. 3. In this figure, we plot \(\alpha ^{*}\) versus \(\varepsilon _{\text {se}}\) for different values of \(\overline{\gamma }_{\text {sr}}/\overline{\gamma }_{\text {se}}\). We can see that the optimal \(\alpha ^{*}\) that achieves \(P_{\text {so}}^{*}\left( \alpha ,\beta ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right)\) decreases as \(\varepsilon _{\text {se}}\) decreases, indicating that the source needs to use more power to confuse the eavesdropper when the eavesdropper requires a higher decoding accuracy. Although not shown here, we note that the target decoding error probability at the legitimate receiver \(\varepsilon _{\text {sb}}\) also has a significant impact on the optimal power allocation factor. Specifically, \(\alpha ^{*}\) increases when \(\varepsilon _{\text {sb}}\) decreases. This is because, when the legitimate receiver has a more strict requirement on the decoding error probability, the source needs to allocate more power to the confidential signal in order to achieve the optimal secrecy performance.
Results and discussion
Due to shortpacket transmissions in URLLC, the confidential information is inevitably leaked to the eavesdropper and perfect secrecy cannot be achieved. It follows that secrecy performance metrics commonly used in existing physical layer security techniques, such as the achievable secrecy rate and the SOP, are not directly applicable for evaluating the secrecy performance of URLLC. To address this problem, we adopt a lower bound on the maximal secrecy rate for shortpacket transmissions in URLLC, characterizing the relationships among the target decoding error probabilities at the legitimate receiver and the eavesdropper, and derived the generalized SOP that the lower bound is smaller than a certain threshold. In addition, we considered that the source transmits the AN signal, in addition to the confidential signal, and showed how the secrecy performance of URLLC can be significantly improved by adjusting the power allocated to the confidential signal.
Availability of data and materials
Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.
Notes
In this paper, we refer the term “classical informationtheoretic secrecy” to as Shannon’s weak secrecy only.
This assumption refers to a worstcase scenario where \(\rho \left( \alpha ,L,\varepsilon _{\text {sr}},\varepsilon _{\text {se}}\right) \) is minimized. As such, our derived expression of the generalized SOP can be regarded as an upper bound on the secrecy outage performance of shortpacket transmissions in URLLC.
Abbreviations
 URLLC:

Ultrareliable and lowlatency communications
 AN:

Artificial noise
 SOP:

Secrecy outage probability
 5G:

The fifth generation
 QoS:

Qualityofservice
 E2E:

Endtoend
 CSI:

Channel state information
References
3GPP TR 38.913: study on scenarios and requirements for next generation access technologies. Technical report. Release 14. 3GPP (2016)
C. Yang, C. Sun, Z. Gu, Y. Li, C. Yang, H.V. Poor, B. Vucetic, A tutorial of ultrareliable and lowlatency communications in 6G: integrating theoretical knowledge into deep learning. arXiv:2009.06010
A. Aijaz, M. Dohler, A.H. Aghvami, V. Friderikos, M. Frodigh, Realizing the tactile internet: haptic communications over next generation 5G cellular networks. IEEE Wirel. Commun. 24(2), 82–89 (2017)
P. Schulz, M. Matthé, H. Klessig et al., Latency critical IoT applications in 5G: perspective on the design of radio interface and network architecture. IEEE Commun. Mag. 55(2), 70–78 (2017)
H.V.K. Mendis, F.Y. Li, Achieving ultra reliable communication in 5G networks: a dependability perspective availability analysis in the space domain. IEEE Commun. Lett. 21(9), 2057–2060 (2017)
C. She, C. Yang, T.Q.S. Quek, Radio resource management for ultrareliable and lowlatency communications. IEEE Commun. Mag. 55(6), 72–78 (2017)
C. She, C. Yang, T.Q.S. Quek, Crosslayer optimization for ultrareliable and lowlatency radio access networks. IEEE Trans. Wirel. Commun. 17(1), 127–141 (2018)
C. She, C. Liu, T.Q.S. Quek, C. Yang, Y. Li, Ultrareliable and lowlatency communications in unmanned aerial vehicle communication systems. IEEE Trans. Commun. 67(5), 3768–3781 (2019)
P. Popovski, et al. Deliverable d6.3 intermediate system evaluation results. ICT317669METIS/D6.3 (2014)
C. She et al., Deep learning for ultrareliable and lowlatency communications in 6G networks. IEEE Netw. (2020). https://doi.org/10.1109/MNET.011.1900630
N. Yang, L. Wang, G. Geraci, M. Elkashlan, J. Yuan, M.D. Renzo, Safeguarding 5G wireless communication networks using physical layer security. IEEE Commun. Mag. 53(4), 20–27 (2015)
A. Mukherjee, S.A.A. Fakoorian, J. Huang, A.L. Swindlehurst, Principles of physical layer security in multiuser wireless networks: a survey. IEEE Commun. Surv. Tutor. 16(3), 1550–1573 (2014)
L. Senigagliesi, M. Baldi, S. Tomasin, Resource allocation for secure Gaussian parallel relay channels with finitelength coding and discrete constellations. arxiv:1807.06448
H.M. Wang, Q. Yang, Z. Ding, H.V. Poor, Secure shortpacket communications for missioncritical IoT applications. IEEE Trans. Wirel. Commun. 18(5), 2565–2578 (2019)
W. Yang, R.F. Schaefer, H.V. Poor, Finiteblocklength bounds for wiretap channels, in Proceedings of IEEE International Symposium on Information Theory (ISIT). Barcelona, Spain, pp. 3087–3091 (2016)
W. Yang, R.F. Schaefer, H.V. Poor, Wiretap channels: nonasymptotic fundamental limits. arxiv.org/pdf/1706.03866v1
W. Yang, G. Durisi, T. Koch, Y. Polyanskiy, Quasistatic multipleantenna fading channels at finite blocklength. IEEE Trans. Inf. Theory 60(7), 4232–4264 (2014)
A.D. Wyner, The wiretap channel. Bell Syst. Tech. J. 54(8), 1355–1387 (1975)
M. Bloch, J. Barros, PhysicalLayer Security. From Information Theory to Security Engineering (Cambridge University Press, Cambridge, 2011)
C. Liu, N. Yang, J. Yuan, R. Malaney, Locationbased secure transmission for wiretap channels. IEEE J. Sel. Areas Commun. 33(7), 1458–1470 (2015)
C. Liu, J. Lee, T.Q.S. Quek, Safeguarding UAV communications against fullduplex active eavesdropper. IEEE Trans. Wirel. Commun. 18(6), 2919–2931 (2019)
Acknowledgements
Not applicable.
Funding
This work was supported in part by the National Natural Science Foundation of China under Grant No. 61971403 and in part by the Special Presidential Foundation of Technology and Engineering Center for Space Utilization of the Chinese Academy of Sciences under Project CSUQZKT201816.
Author information
Authors and Affiliations
Contributions
JH carried out the statistical analysis and drafted the manuscript. GZcarried out the system modeling and the design of the artificial noise. LW performed the simulations and helped to draft the manuscript. XS helped with the statistical analysis and participated in the simulations. LY participated in the simulations and helped to draft the manuscript. All the authors read and approved the submitted manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
He, J., Zhao, G., Wang, L. et al. Secrecy analysis of shortpacket transmissions in ultrareliable and lowlatency communications. J Wireless Com Network 2021, 29 (2021). https://doi.org/10.1186/s13638020018627
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13638020018627
Keywords
 Ultrareliable and lowlatency communications
 Physical layer security
 Shortpacket transmissions