We consider a $K$ -user interference network with $M$ states, where each transmitter has up to $M$ messages and over State $m$ , Receiver $k$ wishes to decode the first $\pi _{k}(m) \in \{ 1,2,\cdots ,M \}$ messages from its desired transmitter. This problem of channel with states models opportunistic communications, where more messages are decoded for better channel states. The first message from each transmitter has the highest priority as it is required to be decoded regardless of the state of the receiver; the second message is opportunistically decoded if the state allows a receiver to decode 2 messages; and the $M$ -th message has the lowest priority as it is decoded if and only if the receiver wishes to decode all $M$ messages. For this interference network with states, we show that if any possible combination of the channel states satisfies a condition under which power control and treating interference as noise (TIN) are sufficient to achieve the entire generalized degrees of freedom (GDoF) region of this channel state by itself, then a simple layered superposition encoding scheme with power control and a successive decoding scheme with TIN achieves the entire GDoF region of the network with $M$ states for all $KM$ messages.

中文翻译：

---

机会主义地将干扰视为噪声

我们考虑一个 $K$ - 用户干扰网络 百万美元 状态，其中每个发射器最多 百万美元 消息和状态 百万美元 ， 接收者 $千$ 希望解码第一个 $\pi _{k}(m) \in \{ 1,2,\cdots ,M \}$ 来自其所需发送器的消息。这个带有状态的通道问题模拟了机会性通信，其中解码更多消息以获得更好的通道状态。来自每个发送器的第一个消息具有最高优先级，因为无论接收器的状态如何，都需要对其进行解码；如果状态允许接收者解码 2 条消息，则第二条消息被机会解码；和 百万美元 -th 消息具有最低优先级，因为当且仅当接收方希望解码所有 百万美元 消息。对于这个具有状态的干扰网络，我们表明，如果任何可能的信道状态组合满足这样一个条件，即功率控制和将干扰视为噪声 (TIN) 足以实现该信道的整个广义自由度 (GDoF) 区域状态本身，然后具有功率控制的简单分层叠加编码方案和具有 TIN 的连续解码方案实现网络的整个 GDoF 区域 百万美元 所有人的国家 $KM$ 消息。