A graph-based resource allocation scheme with interference coordination in small cell networks

Abstract

We present a novel graph-based resource allocation and interference coordination framework to mitigate downlink interference in small cell networks. In our scheme, two types of clusters from the original network are generated, namely cell-cluster and user-cluster. We first divide small cells into cell-clusters according to their neighboring relationships in the network and examine the network morphology under different neighborhood bounds. Then we develop another graph clustering scheme to group the users in each cell-cluster into user-clusters with minimum intra-cluster interference. Finally, we employ a proportional fair scheduling scheme to assign subchannels among the user-clusters and allocate power using water-filling method. The simulation results show that our method achieves a significant improvement in spectral efficiency compared to previous works under both co-channel and orthogonal deployments. Globecom 2014 Workshop -Heterogeneous and Small Cell Networks 978-1-4799-7470-2/14/$31.00 ©2014 IEEE

A Dynamic Graph-Based Scheduling and Interference Coordination Approach in Heterogeneous Cellular Networks

“…From Figure 10 we can see that as the transmit power of SeNB is increased from 28 dBm to 38 dBm, the average network spectral efficiency increases for all the approaches except that beyond 34 dBm, the performance of the distributed approach starts decreasing as the network becomes interference limited. While the other approaches have much better performance than the distributed approach especially at a high level of maximum SeNB power, the graph-based approach only slightly under-perform the dual-based approach but outperform the approach in [18]. We also obtain similar results in orthogonal deployments.…”

“…It is obvious that the graph-based approach achieves far better performance as the distributed approach is completely ignorant of the cross-tier or the co-tier interference. Besides, our graph-based approach achieves better performance than our former approach [18]. Moreover, the graph-based approach can achieve more than 90 percent of the performance of the dual-based approach while incurring much lower computation complexity, which is more suitable for real-time implementation.…”

“…In our previous work [18], we proposed a simple graphbased approach that considers the typical coverage of small cells and the relative channel gain of UEs as the metric. Based on the previous work, we propose an improved graph-based approach including cell-clustering and UE-clustering in this paper.…”

“…Next, we compare our graph-based approach with the proposed dual-based approach, our former approach [18] and the distributed approach without interference coordination. In the distributed approach, we adopt the same subchannel and power allocation method as in the graph-based approach and implement it in each cell, which is equivalent to the extreme case that treats each cell as a cell-cluster in the graph-based approach.…”

Enhanced Uplink Resource Allocation in Non-Orthogonal Multiple Access Systems

“…One of our previous experience [39] while dealing with interference is, reducing the allocated power level on the subchannels may bring better performance for the system compared to the case when the maximal power of the users are used. This is what exactly observed while allocating subchannels and power among the users in an OFDMAbased network surrounded by many neighboring cells.…”