In this paper, we consider the problem of modelling the average delay experienced by a packet in a single cell IEEE 802.11 DCF wireless local area network. The packet arrival process at each node i is assumed to be Poisson with rate parameter . Since the nodes are sharing a single channel, they have to contend with one another for a successful transmission. The mean delay for a packet has been approximated by modelling the system as a 1-limited Random Polling system with zero switchover time. We show that even for non-homogeneous packet arrival processes, the mean delay of packets across the queues are same and depends on the system utilization factor and the aggregate throughput of the MAC. Extensive simulations are conducted to verify the analytical results.
Our objective is to explore the use of known results for the network and in analyzing the mean delay experienced by a packet. We propose a random polling system framework to analyze mean delay in a single cell wireless local area network. We obtain closed form expressions for mean delay by applying results from @cite_10 to our random polling system framework. We show though simulations that our random polling framework can be used to estimate the mean delay in a single cell IEEE 802.11 wireless local area network in the entire capacity region.
@cite_10
2131784952
We introduce a simple approach for modeling and analyzing the random polling system with asymmetric arrival rates, service times, and switchover times. It is assumed that the customer arrival processes at all queues are correlated Levy input processes. Two classes of service disciplines, random gated and 1-limited, are considered. The random gated service discipline generalizes several known service disciplines. We obtain explicit expressions for several performance measures of the system. These performance measures include the mean and second moment of the cycle time, the queue length at the beginning of a cycle of service and the expected delay observed by a customer. For the special case of independent Poisson input processes at all queues, we also provide new proof of several well-known pseudo-conservation laws.