A Markovian model is proposed in this paper to study the performance of
1-persistent CSMA/CA protocols, from which we obtain stable regions with
respect to the throughput and bounded delay of Geometric Retransmission and
Exponential Backoff scheduling algorithms. Our results show that the throughput
of Geometric Retransmission is unstable for large n while the throughput of
Exponential Backoff still exists for n -> infinity.
This paper studies the performance of Non-persistent CSMA/CA protocols with
K-Exponential Backoff scheduling algorithms. A multi-queue single-server system
is proposed to model multiple access networks. The input buffer of each access
node is modeled as a Geo/G/1 queue, and the service time distribution of
head-of-line packets is derived from the Markov chain of underlying scheduling
algorithm.