Before revision: 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 .
After revision: A Markovian model is proposed in this paper to study the performance of 1-persistent CSMA / G/1 queue, and the service time distribution of each individual head-of-line packet is derived from the Markov chain of underlying scheduling algorithm, from which we obtain stable regions with respect to the throughput and bounded delay of Geometric Retransmission and Exponential Backoff scheduling algorithms .