Random capture algorithms fluid limits and stability

We introduce a distributed stateless MAC protocol referred to as Random Capture Algorithm (RCA) and analyze its performance in networks where interference is modeled by a contention graph. RCA does not require any message passing, nor transmitters to be aware of the content of their respective buffers. Yet, it achieves at least the same stability region as that obtained with maximal scheduling. We prove that RCA is actually throughput optimal in networks with N-partite interference graphs. We present simulation results that suggest that RCA is also throughput optimal on simple networks whose interference graphs are not N-partite. From there, it is tempting to conjecture that RCA are throughput optimal in all networks.