K -User Interference Channels With Backhaul Cooperation: DoF vs. Backhaul Load Trade-Off

In this paper, we consider K-user interference channels with M antennas per node and with backhaul collaboration in one side (among the transmitters or among the receivers), for M, K ∈ N, and investigate the tradeoff between the rate in the channel versus the communication load in the backhaul. In this investigation, each node is equipped with M antennas and we focus on a first order approximation result, where the rate of the wireless channel is measured by the degrees of freedom (DoF) per user, and the load of the backhaul is measured by the entropy of backhaul messages per user normalized by log of transmit power, at high power regimes. This tradeoff is fully characterized for the case of even values of K and approximately characterized for the case of odd values of K, with vanishing approximation gap as K grows. To achieve DoF of M per user, this result establishes the asymptotic optimality of the most straightforward scheme, called central processing, in which the messages are collected at one of the nodes, centrally processed, and forwarded back to each node. In addition, this result shows that the gain of the schemes, relying on distributed processing, through pairwise communication among the nodes (e.g., cooperative alignment) does not scale with the size of the network. For the converse, we develop a new outer-bound on the tradeoff based on splitting the set of collaborative nodes (transmitters or receivers) into two subsets and assuming full cooperation within each group. We further present a sufficient condition on the wireless channel connectivity, which although more relaxed, guarantees the validity of the above tradeoff. Finally, we show that verifying this condition takes a polynomial time in the network size.