Analysis of Maximal Topologies Achieving Optimal DoF and DoF frac{1}{n} in Topological Interference Management

Topological interference management (TIM) can obtain degrees of freedom (DoF) gains with no channel state information at the transmitters (CSIT) except topological information of network in the interference channel. It was shown that TIM achieves the optimal symmetric DoF when internal conflict does not exist among messages. However, it is difficult to assure whether a specific topology can achieve the optimal DoF without scrutinizing internal conflict, which requires lots of works. Also, it is hard to design a specific optimal topology directly from the conventional condition for the optimal DoF. With these problems in mind, we propose a method to derive maximal topology directly in TIM, named as alliance construction in K-user interference channel. That is, it is proved that a topology is maximal if and only if it is derived from alliance construction. We translate a topology design by alliance construction in message graph into topology matrix and propose conditions for maximal topology matrix (MTM). Moreover, we propose a generalized alliance construction that derives a topology achieving DoF 1/n for n>=3 by generalizing sub-alliances. A topology matrix can also be used to analyze maximality of topology with DoF 1/n.