| Abstract |
In this paper, channel-aware scheduling algorithms that are applicable for delay-tolerant applications in centralized wireless networks are compared in a new universal framework, inspired by the theoretical limits of information theory. The scheduling algorithms are compared in terms of their efficiency in allocating the wireless resources, and this efficiency is measured against the theoretically achievable optimum for the operating point chosen, e.g., by the network operator. As an illustrative example the two-user case is analyzed, although, qualitatively, the results carry over to the M-user case. We also consider the practically relevant case, in which system constraints enforce the use of an orthogonal multiple-access scheme and constant transmission power. |