TY - GEN
T1 - How to Trade Reliability for Security in Machine-Type Communications
T2 - 2023 IEEE International Conference on Communications, ICC 2023
AU - Zhu, Yao
AU - Yuan, Xiaopeng
AU - Hu, Yulin
AU - Schaefer, Rafael F.
AU - Schmeink, Anke
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Data security is one of the key concerns in the next generation of ultra-reliable and low-latency networks, especially with machine-type communications. In this work, we propose a novel metric, leakage-failure probability, to represent the reliable-secure performance of the considered system. We discover that the system performance can be enhanced by counter-intuitively trading the reliability for security, i.e., allocating less blocklength in the short-packet transmission. In order to solve the corresponding blocklength allocation problem, we propose a novel optimization framework, for which a lower-bounded approximation of the decoding error probability in the finite blocklength regime is provided. Based on that, we reformulate the optimization problem into a convex one and propose an iterative searching method. We show the efficiency and the convergence of such a method analytically. Furthermore, we discuss the extendability of the proposed framework with an example of the effective secure throughput as the metric. Via numerical results, we verify the performance of the optimization problem and demonstrate the reliability-security tradeoff under various setups.
AB - Data security is one of the key concerns in the next generation of ultra-reliable and low-latency networks, especially with machine-type communications. In this work, we propose a novel metric, leakage-failure probability, to represent the reliable-secure performance of the considered system. We discover that the system performance can be enhanced by counter-intuitively trading the reliability for security, i.e., allocating less blocklength in the short-packet transmission. In order to solve the corresponding blocklength allocation problem, we propose a novel optimization framework, for which a lower-bounded approximation of the decoding error probability in the finite blocklength regime is provided. Based on that, we reformulate the optimization problem into a convex one and propose an iterative searching method. We show the efficiency and the convergence of such a method analytically. Furthermore, we discuss the extendability of the proposed framework with an example of the effective secure throughput as the metric. Via numerical results, we verify the performance of the optimization problem and demonstrate the reliability-security tradeoff under various setups.
KW - URLLC
KW - finite blocklength regime
KW - machine-type communications
KW - physical layer security
UR - http://www.scopus.com/inward/record.url?scp=85178300927&partnerID=8YFLogxK
U2 - 10.1109/ICC45041.2023.10278562
DO - 10.1109/ICC45041.2023.10278562
M3 - Conference contribution
AN - SCOPUS:85178300927
T3 - IEEE International Conference on Communications
SP - 4353
EP - 4359
BT - ICC 2023 - IEEE International Conference on Communications
A2 - Zorzi, Michele
A2 - Tao, Meixia
A2 - Saad, Walid
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 28 May 2023 through 1 June 2023
ER -