摘要 : This paper investigates subchannel allocation based on clustered interference alignment in dense small cell networks when all small cell user equipments (SUEs) have differentiated requirements for data streams. By imposing the con... 展开 This paper investigates subchannel allocation based on clustered interference alignment in dense small cell networks when all small cell user equipments (SUEs) have differentiated requirements for data streams. By imposing the condition that each cluster has a size not exceeding the maximum value achieved when each SUE needs only one data stream, we maximize the number of SUEs with guaranteed requirements for data streams, which is NP-hard. Hence, we propose a two-phase efficient solution with much lower complexity and reduced feedback overhead. First, similarity clustering is performed by graph partition, and then, subchannel allocation is done through a coloring algorithm. Numerical results show that the proposed solution offers a performance better than the related schemes and close to the approximate optimal solution. 收起