Random access scheduling with constant collision rate

Abstract

Wireless scheduling has been extensively studied in the literature. Since Maximum Weighted Scheduling has been developed and shown to achieve the optimal performance, there have been many efforts to overcome its complexity issue. In this paper, we develop a novel random access scheduling scheme that maintains constant collision rate. We employ the Additive Increase Multiplicative Decrease (AIMD) control algorithm, and show that our proposed scheme can achieve the same performance bound as the previous random access schemes with high control overhead. We show through simulations that our proposed scheme achieves the performance close to that of the centralized greedy algorithm.