Slotted np-CSMA with Poisson-Based Packet Size Using Semi-Markov Process

In this paper, a slotted non-persistent carrier sense multiple access (slotted np-CSMA) protocol using the semi-Markov graph representation is presented. CSMA is a random access protocol which has been widely used in packet communication systems. The main feature of CSMA development is that each link with a pair of transmitter-receiver senses the medium, then transmits a packet only if the medium is sensed idle. CSMA has been presented as random access protocols to avoid the packet collision using the absence of acknowledgment packet for the receiving station. There are different modeling of this protocol based on Markov chain. Note that the packet size is always unitary while the CSMA protocol is always Poisson-oriented. The semi-Markov graph-based analysis that is used to present for the performance of protocol. This paper presents the study about throughput of slotted np-CSMA systems for the offered traffic. Simulation results show that the maximum throughput of slotted np-CSMA using semi-Markov model achieves well performance in comparison with using Markov model related to lower propagation delay.