To answer the call for a new theoretical framework to simultaneously accommodate random user activity and heterogeneous delay traffic in Internet of Things (IoT) systems, in this paper we propose coding schemes and information-theoretic converse results for the transmission of heterogeneous delay traffic over interference networks with random user activity and random data arrivals. The heterogeneous traffic is composed of delay-tolerant traffic and delay-sensitive traffic where only the former can benefit from transmitter and receiver cooperation since the latter is subject to stringent decoding delays. The total number of cooperation rounds at transmitter and receiver sides is limited to $\D$ rounds. Each transmitter is active with probability $\rho \in [0,1]$. We consider two different models for the arrival of the mixed-delay traffic: in Model~$1$, each active transmitter sends a delay-tolerant message, and with probability $\rho_f \in [0,1]$ also transmits an additional delay-sensitive message; in Model~$2$, each active transmitter sends either a delay-sensitive message with probability $\rho_f$ or a delay-tolerant message with probability $1-\rho_f$. We derive inner and outer bounds on the fundamental per-user multiplexing gain (MG) region of the symmetric Wyner network as well as inner bounds on the fundamental MG region of the hexagonal model. Our inner and outer bounds are generally very close and coincide in special cases. They also show that when both transmitters and receivers can cooperate, then under Model~$1$, transmitting delay-sensitive messages hardly causes any penalty on the sum per-user MG, and under Model~$2$, operating at large delay-sensitive per-user MGs incurs no penalty on the delay-tolerant per-user MG and thus increases the sum per-user MG.

翻译：为满足物联网系统中同时兼顾随机用户活动与异构延迟流量的新理论框架需求，本文针对具有随机用户活动与随机数据到达的干扰网络，提出了异构延迟流量传输的编码方案及信息论逆结果。异构流量由容忍延迟流量与敏感延迟流量组成，其中仅前者能从收发端协作中获益，后者受限于严格解码延迟。收发端协作总轮数限制为$\D$轮。每个发射机以概率$\rho \in [0,1]$处于激活状态。我们考虑两种混合延迟流量到达模型：模型$1$中，每个激活发射机发送一个容忍延迟消息，并以概率$\rho_f \in [0,1]$额外发送一个敏感延迟消息；模型$2$中，每个激活发射机以概率$\rho_f$发送敏感延迟消息，或以概率$1-\rho_f$发送容忍延迟消息。我们推导了对称Wyner网络基本每用户复用增益（MG）区域的内外边界，以及六边形模型基本MG区域的内边界。内外边界通常非常接近，并在特殊情形下重合。结果还表明：当收发端均可协作时，在模型$1$下传输敏感延迟消息几乎不损害每用户MG之和；在模型$2$下，以高敏感延迟每用户MG运行时，不会对容忍延迟每用户MG造成损失，从而提升每用户MG之和。