Performance of Low-Complexity Greedy Scheduling Policies in Multi-Channel Wireless Networks: Optimal Throughput and Near-Optimal Delay

Provided by: Ohio State University Topic: Mobility Format: PDF
In this paper, the authors focus on the scheduling problem in multi-channel wireless networks, e.g., the downlink of a single cell in Fourth Generation (4G) OFDM-based cellular networks. Their goal is to design efficient scheduling policies that can achieve provably good performance in terms of both throughput and delay, at a low complexity. While a recently developed scheduling policy, called Delay Weighted Matching (DWM), has been shown to be both rate-function delay-optimal (in the many-channel many-user asymptotic regime) and throughput-optimal (in general non-asymptotic setting), it has a high complexity O(n5), which makes it impractical for modern OFDM systems.

Find By Topic