Throughput analysis of CSMA protocol with Exponential Backoff

This paper studies the performance of Non-persistent CSMA protocols using K-Exponential Backoff collision resolution algorithms. We model it as a multi-queue single-server system with infinite buffer size and consider the service time distribution of Head-of-line packets as a Markov Chain to get the network throughput as well as the stability. The stable region of retransmission factor q is illustrated in examples of Exponential Backoff (K=∞). For throughput stability, we show the stabilized throughput can be obtained in networks even for infinite nodes.