Analytical study of a slotted CSMA protocol on a two-state Markov channel

The paper presents an analytical investigation of a simple medium access scheme for wireless networks based on a channel sensing and a retransmission scheme, used to recover packet errors due to wrong channel. The system is slotted and the channel has been modeled by means of a two-state Markov chain to simulate bursty errors. For the sake of simplicity, the case of zero round-trip delay and of reliable feedback channel has been taken into account. The theory developed has the aim to evaluate the queue state evolution of the generic node in the network, in order to estimate the average number of packets present in the queue in the generic slot and the average time to transmit a packet System simulations have been performed to validate the analytical approach.