New methods to color the vertices of a graph
Communications of the ACM
Channel assignment and graph multicoloring
Handbook of wireless networks and mobile computing
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey
IEEE Communications Surveys & Tutorials
Advanced interference mitigation with frequency reuse schemes in the IEEE 802.16m uplink
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
A survey of scheduling and interference mitigation in LTE
Journal of Electrical and Computer Engineering - Special issue on LTE/LTE-advanced cellular communication networks
A distributed resource management framework for interference mitigation in OFDMA femtocell networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Performance analysis of a cellular network using frequency reuse partitioning
Performance Evaluation
Selecting the Optimal Fractional Frequency Reuse Scheme in Long Term Evolution Networks
Wireless Personal Communications: An International Journal
IEEE/ACM Transactions on Networking (TON)
Distributed adaptive interference control in 4G small cell networks
WiFlex'13 Proceedings of the First international conference on Wireless Access Flexibility
Fairness Guaranteed Cooperative Resource Allocation in Femtocell Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
A graph-based framework for dynamic fractional frequency reuse (FFR) in multi-cell OFDMA networks is proposed in this work. FFR is a promising resource allocation technique that can effectively mitigate inter-cell interference (ICI) in OFDMA networks. The proposed scheme enhances the conventional FFR by enabling adaptive spectral sharing per cell load conditions. Such adaptation has significant benefits in a practical environment where traffic load in different cells may be asymmetric and time-varying. The dynamic feature is accomplished via a graph approach in which the resource allocation problem is translated to a graph coloring problem. Specifically, in order to incorporate various versions of FFR in our framework, we construct a graph that matches the specific version of FFR and then color the graph using the corresponding graph algorithm. The performance improvement enabled by the proposed dynamic FFR scheme is further demonstrated by computer simulation for a 19-cell network with asymmetric cell load. For instance, the proposed dynamic FFR scheme can achieve a 12% and 33% gain in cell throughput and service rate over conventional FFR, and render a 70% and 107% gain in cell throughput and service rate with respect to the reuse-3 system.