v(t) CSMA

Abstract

Efficient scheduling of wireless resources has always been one of the most challenging tasks for wireless networks. To achieve throughput-optimality, traditional back-pressure algorithms calculate a maximal weight matching at each time slot. However, these algorithms need centralized scheduling with high complexity, and thus are not suitable for practical distributed implementations. A class of distributed queue-length-based CSMA algorithms have been proposed that achieve throughput optimality, which we refer to as regular throughput-optimal. These algorithms suffer from two problems: large delays, and temporal starvation. In this demo we demonstrate the operation of the v(t)-regulated CSMA algorithm that mitigates these two problems while provably retaining throughput optimality. The demo allows the participants to see the the performance advantage of v(t)-regulated CSMA over queue-length-based CSMA algorithms and change the different system parameters.