Fundamental Limit Among Covertness, Reliability, Latency and Throughput for IRS-Enabled Short-Packet Communications
Manlin Wang, Bin Xia, Yao Yao, Zhiyong Chen, Jiangzhou Wang
Abstract
Short-packet communications are applied to various scenarios where transmission covertness and reliability are crucial due to the open wireless medium and finite blocklength. Nonetheless, transmission covertness and reliability present a dilemma and significantly limit the throughput for short-packet communications. Intelligent reflection surface (IRS) is utilized in this paper to address this issue by enabling channel reconstruction, thereby releasing the fundamental limit between transmission covertness, reliability, latency (blocklength), and throughput. Specifically, to reveal the benefits brought by IRS, the achievable throughput without IRS is derived first in terms of the transmission covertness requirement, reliability requirement, and blocklength. Subsequently, the achievable throughput with IRS is derived, which releases the fundamental limit among the above-mentioned performance metrics. Besides, considering the phase uncertainty at IRS and limited channel estimation overhead, the cases where the warder/IRS knows instantaneous/statistical channel state information (CSI) of warder-related/legitimate links are all discussed, elucidating the impacts of CSI availability on the throughput. Furthermore, numerical results verify the accuracy of analytical results and demonstrate the benefits provided by IRS. Especially, the achievable covertness and reliability performance can be enhanced while the minimum required blocklength can be reduced by introducing IRS, which is crucial for short-packet communications.