Evolutionary algorithm for proportional fair scheduling of device-to-device communications underlaying multi-carrier cellular networks

Abstract

In D2D communication underlaying cellular networks, effective use of the radio resources is required to increase the total capacity of the entire networks. For satisfying the above requirement, practical and effective scheduling is necessary. An optimal proportional fair (PF) scheduling scheme that maximizes the logarithmic sum of the average user data rates provides an attractive trade-off between the user fairness and average data rates. Considering the fact that the optimal PF scheduling has the significantly high computational complexity, this paper proposes the evolutionary algorithm which has lower complexity than that of the optimal PF scheduling. The evolutionary algorithm achieves high logarithmic sum of the average user data rates while maintaining low computational complexity. Simulation results verify the performance of the proposed algorithms by comparing it with the optimal PF scheduling.