On Energy-Delay Tradeoff in Uncoordinated MAC
On Energy-Delay Tradeoff in Uncoordinated MAC
复制标题
DOI：
10.1109/allerton58177.2023.10313356
复制
发表时间：
2023-09
期刊：
影响因子：
--
通讯作者：
Yuming Han;Zixiang Xiong;Anders Høst-Madsen
中科院分区：
文献类型：
--
作者：
Yuming Han;Zixiang Xiong;Anders Høst-Madsen
Polyanskiy[1]提出了一个解决具有大量用户的MAC问题的框架，其中用户在有限块长度的情况下使用公共码本。在这项工作中，我们将[1]推广到在随机时刻产生分组且存在时延约束的情况。我们首先定义了一个随机接入信道，并推导出它的一般逆界。我们的界限捕捉到了所需能量和延迟约束之间的基本权衡。在此基础上，给出了分组传输的可达界。在这种情况下，所有分组都在下一个间隔传输，以避免干扰。然后，我们研究了在单用户和多用户的情况下将干扰视为噪声(TIN)。最后，我们得到了数据包分割模型的一个可实现的界，该模型允许用户将每个数据包分割成两个不同块长度的部分。数值结果表明，当时延较大时，TIN是有效的，而分组分割则随着时延的减小而表现出更好的性能。
Polyanskiy [1] proposed a framework for the MAC problem with a large number of users, where users employ a common codebook in the finite blocklength regime. In this work, we extend [1] to the case when packets are generated at random times and there is also a delay constraint. We first define a random-access channel and derive the general converse bound. Our bound captures the basic tradeoff between the required energy and the delay constraint. Then we propose an achievable bound for block transmission. In this case, all packets are transmitted at the next interval to avoid interference. We then study treating interference as noise (TIN) with both single user and multiple users. Last, we derive an achievable bound for the packet splitting model, which allows users to split each packet into two parts with different blocklengths. Our numerical results indicate that, when the delay is large, TIN is effective; on the other hand, packet splitting outperforms as the delay decreases.