On the Degrees-of-Freedom of Two-Unicast Wireless Networks With Delayed CSIT

We characterize the degrees-of-freedom (DoF) region of a class of two-unicast wireless networks under the assumption of delayed channel state information at the transmitters. We consider a layered topology with arbitrary connectivity, and we introduce new outer-bounds on the DoF region of such networks through the graph-theoretic notion of bottleneck nodes. Such nodes act as informational bottlenecks only under the assumption of delayed channel state information. We also present new transmission schemes that achieve the outer-bounds. We show that unlike the instantaneous channel state information model, the sum DoF of two-unicast networks with delayed channel knowledge can take an infinite set of values. In this paper, we compare our results to the best previously known outer-bounds, and we show that the gap can be arbitrary large in favor.