Title :
On the throughput of CSMA
Author :
Gao, Yayu ; Dai, Lin
Author_Institution :
Dept. of Electron. Eng., City Univ. of Hong Kong, Hong Kong, China
Abstract :
In this paper, a semi-Markov model is established to characterize the throughput performance of CSMA networks. Based on the assumption of Poisson distributed aggregate traffic, the throughput expression of p-persistent CSMA is derived, which includes the results of 1-persistent CSMA and non-persistent CSMA presented in Kleinrock and Tobagis landmark paper as two special cases. The analysis further reveals that the Poisson assumption requires that the transmission probability of packets is small enough, in which case the throughput performance becomes insensitive to the rescheduling policy of packets, i.e., p-persistent or non-persistent, and is solely determined by the normalized propagation delay.
Keywords :
Markov processes; Poisson distribution; carrier sense multiple access; telecommunication traffic; CSMA network; Poisson distributed aggregate traffic; packet rescheduling; propagation delay; semi Markov model; transmission probability; Aggregates; Delay; IEEE 802.11 Standards; Markov processes; Multiaccess communication; Propagation delay; Throughput; Carrier Sense Multiple Access; Poisson; throughput;
Conference_Titel :
Information Sciences and Systems (CISS), 2011 45th Annual Conference on
Conference_Location :
Baltimore, MD
Print_ISBN :
978-1-4244-9846-8
Electronic_ISBN :
978-1-4244-9847-5
DOI :
10.1109/CISS.2011.5766254
