QoS aware distributed matching algorithm for link scheduling in wireless networks

In this paper we propose a QoS aware algorithm for link scheduling in wireless networks. The proposed algorithm uses generalization and modification to a recently presented distributed matching algorithm which computes the matching in O(1) but does not consider QoS aspects. We make some enhancement on the original algorithm to improve its delay and throughput performance. Also, by defining a new regulator parameter, it becomes possible to control the behavior of the algorithm in accordance with different classes of traffic. Simulation results confirm the improvements.