Throughput-Optimal Random Access With Order-Optimal Delay
In this paper, the authors consider CSMA policies for scheduling packet transmissions in multi-hop wireless networks with one-hop traffic. The main contribution of the paper is to propose a novel CSMA policy, called Unlocking CSMA (UCSMA), that enables to obtain both high throughput and low packet delays in large wireless networks. More precisely, they show that for torus interference graph topologies with one-hop traffic, U-CSMA is throughput optimal and achieves order-optimal delay. For one-hop traffic, the delay performance is defined to be order-optimal if the delay stays bounded as the network-size increases.