Heuristic algorithm for proportional fair scheduling in D2D-cellular systems

The effective reuse of the radio resources in D2D communication underlaying cellular system is pivotal for enhancing the total system capacity. Developing practical and effective scheduling schemes is critical to the success of D2D-based cellular systems. An optimal proportionally fair (PF) scheduling scheme that maximizes the logarithmic sum of the user data rates is proposed in this paper. Considering the fact that the computational complexity of the optimal PF scheduling is significantly high, low-complexity heuristic algorithm has also been proposed. It has been shown that the heuristic algorithm achieves high logarithmic sum of the average user data rates while maintaining low-computational complexity. Simulation results are used to verify the performance of the proposed algorithm, and to compare it with the optimal PF scheduling algorithms.