Joint Interference Alignment and Subchannel Allocation in Ultra-Dense Networks

In this paper, we propose one joint interference alignment and subchannel allocation (JIARA) interference management scheme, aiming at maximizing the number of satisfactory users with different degrees of freedom (DoF) demand in ultra-dense wireless networks, while the existing works only consider the same DoF demands. The original JIARA scheme is equivalent to the maximum
$K$
-colorable subgraph (MKCS) problem in graph theory for a given
$K$
-colors and the multicoloring demand at each vertex, hence NP-hard. Therefore, we propose one graph theory based low complexity sub-optimal JIARA scheme. Firstly, we propose one virtual allocation of subchannel based scheme to construct transformed the conflict graph, which is applicable for the different DoF demands and different size of the feasible IA group. Furthermore, we propose one greedy multi-coloring based algorithm to determine the maximum number of satisfactory users. Simulation results show that the proposed JIARA scheme outperforms the subchannel resource allocation only scheme.