Greedy Maximal Scheduling in Wireless Networks

TL;DR

This paper analyzes greedy scheduling algorithms in wireless networks, providing stability bounds for Longest Queue First and Static Priority schemes, and introduces a heuristic for priority assignment with simulation validation.

Contribution

It introduces new stability bounds for greedy scheduling algorithms and proposes a heuristic priority assignment method inspired by EM algorithms.

Findings

Derived a closed-form lower bound for LQF stability region.

Proposed a lower bound for SP scheduling with multiple priorities.

Validated the heuristic algorithm's performance through simulations.

Abstract

In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling, where the priorities are computed using queue lengths, and 2) Static Priority (SP) scheduling, where the priorities are pre-assigned. We first propose a closed-form lower bound stability region for LQF scheduling, and discuss the tightness result in some scenarios. We then propose an lower bound stability region for SP scheduling with multiple priority vectors, as well as a heuristic priority assignment algorithm, which is related to the well-known Expectation-Maximization (EM) algorithm. The performance gain of the proposed heuristic algorithm is finally confirmed by simulations.