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 . Moreover,  the bounded delay region of Geometric Retransmission is the same as its stable throughput region; but that of Exponential Backoff is  a sub-set of its stable throughput region  . All analytical results  are verified by simulation.
A Markovian model of 1-persistent CSMA/CA protocols with K-Exponential Backoff scheduling algorithms is proposed in this paper . The input buffer of each access node is modeled as a Geo / 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 of the retransmission factor that ensures the throughput stability of the system and bounded mean delay of input packets . Our results show that the throughput of Geometric Retransmission (K = 1) is inherently unstable for large n since its stable throughput region vanishes as the number of nodes n -> infinity; while the throughput stable region of Exponential Backoff still exists even for an infinite population . Moreover, we find that the bounded delay region of Geometric Retransmission is the same as its stable throughput region; but that of Exponential Backoff is only a sub-set of its stable throughput region due to the capture effect, which causes large variances of the service time of input packets . All analytical results presented in this paper are verified by simulation.
A
of 1-persistent CSMA/CA protocols with K-Exponential Backoff scheduling algorithms
R
to study the performance of 1-persistent CSMA
. The input buffer of each access node is modeled as a Geo
R
CA protocols, from
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
R
with respect to the throughput and bounded delay of Geometric Retransmission and Exponential Backoff scheduling algorithms
of the retransmission factor that ensures the throughput stability of the system and bounded mean delay of input packets
R
is
(K = 1) is inherently
A
since its stable throughput region vanishes as the number of nodes n -> infinity;
A
stable region
R
for n -> infinity
even for an infinite population
A
we find that
A
only
A
due to the capture effect, which causes large variances of the service time of input packets
A
presented in this paper