Date Added: Mar 2010
This paper addresses a distributed throughput-optimal CSMA/CA for wireless ad hoc networks, which is called the preemptive CSMA/CA. It achieves the optimality in a completely distributed fashion, even with discrete backoff time, non-zero carrier sense delay and data packet collisions. The algorithm is derived from the extension of Q-CSMA by Ni, Bo and Srikant to include collisions and is similar to the Jiang and Walrand's CSMA/CA. The analysis on the preemptive CSMA/CA provides with the understanding on the relationship among the throughput-optimal CSMA/CAs in the literature.