9 problems

Interference mitigation conjecture. A combination of transmitter and receiver cooperation should allow the system to mitigate most of the interference and essentially eliminate any…

Consider an interference queueing network on the $d$-dimensional grid with arrival rate $\lambda$ and interference sequence $(a_i)_{i\in\mathbb{Z}}$. Instability conjecture. For al…

Let $x_{0;\infty}(0)$ denote the queue length at the origin at time $0$ in the minimal stationary solution of the interference queueing network on the grid, with arrival rate…

Consider interference networks with $K$ base station–mobile terminal pairs, connectivity parameter $L\geq 1$, and each mobile terminal associated with $N_c$ base stations. Restrict…

Consider the $2\times 2$ X channel and the $3$-user interference channel with delayed channel-state information (CSI). Existing upper bounds for these channels were obtained under…

Let $K$ users communicate over a layered $M$-hop interference network with delayed channel-state information (CSI), and let its network sum-DoF be the supremum of achievable sum-Do…

Let $K$ users communicate over a single-hop interference network with delayed channel-state information (CSI), and let $\mathsf{DoF}^{\textup{IC}}(K,1)$ denote its network sum-DoF.…

Let $\bar{\mathbf{T}}$, $\bar{\mathbf{R}}$, and $\bar{\mathbf{p}}$ (respectively, $\bar{\mathbf{R}}$, $\bar{\mathbf{T}}$, and $\mathbf{\bar{q}}$) denote the variables corresponding…

In a B-MAC or iTree network, let Algorithm PT and Algorithm PP denote the polite water-filling algorithms discussed in the source, and let $\mathbf{\hat{\Omega}}_{l}^{-1/2}$ be the…