ABSTRACT:

We tend to take into account a scheduled orthogonal frequency division multiplexed (OFDM) wireless cellular network where the channels from the bottom-station to the n mobile users undergo flat fading. Spectral resources are to be divided among the users so as to maximize total user utility. We tend to show that this drawback can be solid as a nonlinear convex optimization drawback, and describe an O(n) algorithm to solve it. Computational experiments show that the algorithm typically converges in around twenty five iterations, where each iteration has a cost that's O(n), with a modest constant. When the algorithm starts from an initial resource allocation that is close to optimal, convergence sometimes takes even fewer iterations. Thus, the algorithm can efficiently track the optimal resource allocation because the channel conditions amendment due to fading. We conjointly show how our techniques will be extended to solve resource allocation issues that arise in wideband networks with frequency selective fading and when the utility of a user is also a function of the resource allocations within the past.