Networking and Mobile Computing

Abstract

A scheduling scheme is proposed to dynamically allocate resources for the downlink data transmission in orthogonal frequency division multiplexing (OFDM) networks. In addition, an algorithm with linear complexity is also presented that is based on maximizing the utility function with respect to average waiting time to allocate subcarriers among users. The total utility is obtained by the algorithm taking advantage of multiuser diversity which includes the current channel conditions and queue length. Several feasible assumptions are allowed to achieve high efficiency while maintaining fairness, which involve frequency and time multiplexing, the information of channel condition being available to the scheduler by pilot signals and each user having a buffer with large capacity for its incoming packets. We demonstrate the effectiveness of our scheme through mathematical analysis and simulation. Keywords: OFDM, utility function, packet scheduling, fairness, delay-sensitive.