Fairness-Driven Fast Resource Allocation for Interference-Free Heterogeneous Networks

Resource allocation in heterogeneous wireless networks is a complex problem. This letter addresses this problem maximizing the sum of logarithms of received rates. From this function, and using the Karush-Kuhn-Tucker (KKT) conditions, this paper proposes an iterative algorithm for allocating resources, which is much faster than conventional techniques. This fast response can be used to optimize larger regions, getting closer to the performance of global and centralized algorithms.