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.
| Original language | English |
|---|---|
| Article number | 9217937 |
| Pages (from-to) | 14049-14054 |
| Number of pages | 6 |
| Journal | IEEE Transactions on Vehicular Technology |
| Volume | 69 |
| Issue number | 11 |
| DOIs | |
| State | Published - Nov 2020 |
Keywords
- Dense small cell networks
- differentiated data streams
- graph theory
- interference alignment
- similarity clustering
- subchannel allocation
Fingerprint
Dive into the research topics of 'Subchannel Allocation Based on Clustered Interference Alignment for Differentiated Data Streams in Dense Small Cell Networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver