TY - GEN
T1 - PLS for Wireless Interference Networks in the Short Blocklength Regime with Strong Wiretap Channels
AU - Sheng, Zhichao
AU - Tuan, Hoang D.
AU - Nasir, Ali A.
AU - Poor, H. Vincent
N1 - Funding Information:
This work was supported in part by the National Natural Science Foundation of China (NSFC) under Grant 61901254, in part by the Australian Research Council’s Discovery Projects under Grant DP190102501, and in part by the U.S. National Science Foundation under Grant CCF-1908308.
Publisher Copyright:
© 2020 IEEE.
PY - 2020/12
Y1 - 2020/12
N2 - This paper considers a wireless interference network in which the communication between multiple transmitter-user pairs is overheard by multiple eavesdroppers (EVs). Based on knowledge of the channel distribution, the goal is to maximize the worst users' secrecy rate under both long (infinite) blocklength and short (finite) blocklength transmissions. Under long blocklength transmission, the performance of the existing algorithms is unsatisfactory when the wiretapped channels are sufficiently strong. To address this drawback, we adopt a time-fraction based information and artificial noise (AN) transmission, under which first the information is transmitted within the initial fraction of the time slot and then AN is transmitted within the remaining fraction. Accordingly, the problem of join optimization of the time fractions, transmit power, and AN power to maximize the minimum secrecy rate is proposed and computed by a path-following algorithm, which iterates feasible points and converges at least to a locally optimal solution. A similar problem under short blocklength transmission is also proposed and computed. The provided simulations results clearly show the merits of the proposed approach.
AB - This paper considers a wireless interference network in which the communication between multiple transmitter-user pairs is overheard by multiple eavesdroppers (EVs). Based on knowledge of the channel distribution, the goal is to maximize the worst users' secrecy rate under both long (infinite) blocklength and short (finite) blocklength transmissions. Under long blocklength transmission, the performance of the existing algorithms is unsatisfactory when the wiretapped channels are sufficiently strong. To address this drawback, we adopt a time-fraction based information and artificial noise (AN) transmission, under which first the information is transmitted within the initial fraction of the time slot and then AN is transmitted within the remaining fraction. Accordingly, the problem of join optimization of the time fractions, transmit power, and AN power to maximize the minimum secrecy rate is proposed and computed by a path-following algorithm, which iterates feasible points and converges at least to a locally optimal solution. A similar problem under short blocklength transmission is also proposed and computed. The provided simulations results clearly show the merits of the proposed approach.
KW - URLLC
KW - interfering network
KW - outage probability
KW - path-following algorithms
KW - secure communication
UR - http://www.scopus.com/inward/record.url?scp=85101256964&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85101256964&partnerID=8YFLogxK
U2 - 10.1109/GLOBECOM42002.2020.9348037
DO - 10.1109/GLOBECOM42002.2020.9348037
M3 - Conference contribution
AN - SCOPUS:85101256964
T3 - 2020 IEEE Global Communications Conference, GLOBECOM 2020 - Proceedings
BT - 2020 IEEE Global Communications Conference, GLOBECOM 2020 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2020 IEEE Global Communications Conference, GLOBECOM 2020
Y2 - 7 December 2020 through 11 December 2020
ER -