Throughput, Delay, and Complexity Tradeoffs in Interference Channels

On the Stability Region of Intermittent Interference Networks

“…1 and F 3 : These cases are similar to F 1 and F 3 in TableIII, respectively.F 2 : According to TableIII, there are two choices for destination queues in F 2 as Q F 1 , Q Similar to F 2 , by changing the users' labels, we can show a → Q F 1 and b → Q By changing the users' labels in F 5 , we find that a → Q F 1 and b → Q…”

“…3) We consider two different regimes based on the results of [16] and our generalized outerbounds in (12), to select the values of δ ij in non-homogeneous channels as: i) 0 ≤ δ i ī ≤ 1 2−δ ii , i = 1, 2, ī = 3 − i where capacity region is known; ii) 1 2−δ ii ≤ δ i ī ≤ 1 as the unknown capacity region; 4) We determine the destination queues with respect to the values of λ i and δ ij , and bits with highest priority are sent at each time instant; 5) We use β to denote the average time instant that a bit stays in the communication network and show by simulation that β ∝ √ n. We assume data bits are arriving during n − β time instants to the transmitters and dedicate last β time instants of communication time to deliver the remained bits in the network queues; 6)…”