Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
