IIT Home Page CNR Home Page

On the Feasibility of Unilateral Interference Cancellation in MIMO Networks

In this paper, we study the feasibility problem in MIMO networks, under the assumption that unilateral inter- ference cancellation is performed. The fundamental problem of MIMO feasiblity refers to whether it is possible to sup- port specified numbers of streams allocated to the links of a MIMO network while cancelling all interference. In unilateral interference cancellation, nodes account only for interfering links that they have been assigned to cancel and ignore other interfering links. This can be safely done because, under a proper interference cancellation assignment, the ignored interference is assigned to other nodes for handling. We present several different formulations of the unilateral feasibility problem and use these formulations to analyze the problem’s complexity and develop heuristic feasibility algorithms. We first prove that the general unilateral feasibility problem is NP-complete. We then identify several special cases where the problem is solvable in polynomial time. These include when only receiver-side interference cancella- tion is performed, when all nodes have two antenna elements, and when the maximum degree of the network’s interference graph is two. Finally, we present several heuristic feasibility algorithms derived from different problem formulations and we evaluate their accuracies on randomly generated MIMO networks.


IEEE/ACM Transactions on Networking, 2014

Autori esterni: Douglas Blough (Georgia Institute of Technology), Srinivasan Ramya (Georgia Institute of Technology)
Autori IIT:

Tipo: Articoli su riviste ISI
Area di disciplina: Computer Science & Engineering
Da pagina 1831 a pagina 1844

Attività: Algoritmica per reti wireless