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.
Delay analysis of IEEE 802.11 DCF is limited in comparison to the throughput studies. In @cite_5 , the authors present delay analysis of an HOL packet for the saturated scenario. In @cite_4 and @cite_7 , the authors extended the model of Tay and Chua @cite_9 by proposing G G 1 queues for each individual user. However, the analysis ignores the random delays due to packet transmissions by other users. The authors arrive at an expression for unsaturated collision probability using fixed point analysis and use the same in their subsequent modelling.
@cite_5 @cite_9 @cite_4 @cite_7
2104428131 2011228372 2101280440 2107403026
This letter presents a new approach to evaluate the throughput delay performance of the 802.11 distributed coordination function (DCF). Our approach relies on elementary conditional probability arguments rather than bidimensional Markov chains (as proposed in previous models) and can be easily extended to account for backoff operation more general than DCF's one. In this paper, a unified analytical framework is established to study the stability, throughput, and delay performance of homogeneous buffered IEEE 802.11 networks with Distributed Coordination Function (DCF). Two steady-state operating points are characterized using the limiting probability of successful transmission of Head-of-Line (HOL) packets p given that the network is in unsaturated or saturated conditions. The analysis shows that a buffered IEEE 802.11 DCF network operates at the desired stable point p=pL if it is unsaturated. pL does not vary with backoff parameters, and a stable throughput can be always achieved at pL. If the network becomes saturated, in contrast, it operates at the undesired stable point p=pA, and a stable throughput can be achieved at pA if and only if the backoff parameters are properly selected. The stable regions of the backoff factor q and the initial backoff window size W are derived, and illustrated in cases of the basic access mechanism and the request-to-send clear-to-send (RTS CTS) mechanism. It is shown that the stable regions are significantly enlarged with the RTS CTS mechanism, indicating that networks in the RTS CTS mode are much more robust. Nevertheless, the delay analysis further reveals that lower access delay is incurred in the basic access mode for unsaturated networks. If the network becomes saturated, the delay performance deteriorates regardless of which mode is chosen. Both the first and the second moments of access delay at pA are sensitive to the backoff parameters, and shown to be effectively reduced by enlarging the initial backoff window size W. We present an analytic model for evaluating the queueing delays at nodes in an IEEE 802.11 MAC based wireless network. The model can account for arbitrary arrival patterns, packet size distributions and number of nodes. Our model gives closed form expressions for obtaining the delay and queue length characteristics. We model each node as a discrete time G G 1 queue and derive the service time distribution while accounting for a number of factors including the channel access delay due to the shared medium, impact of packet collisions, the resulting backoffs as well as the packet size distribution. The model is also extended for ongoing proposals under consideration for 802.11e wherein a number of packets may be transmitted in a burst once the channel is accessed. Our analytical results are verified through extensive simulations. The results of our model can also be used for providing probabilistic quality of service guarantees and determining the number of nodes that can be accommodated while satisfying a given delay constraint. We consider the following two views of an IEEE 802.11 based Wireless LAN: (i) as seen by the WLAN medium and (ii) as seen by a user. In the system centric view, we model the WLAN medium as a server that allocates its resources to users in a round Robin manner. This resource sharing model not only provides a simple model for the system, it also enables us to derive the channel service rate and the total delay incurred in transmitting a packet. For Poisson arrivals, the resource sharing model takes the form of an M G 1 PS system with the mean delay being the same as that in an equivalent M M 1 system. We then take a user centric view and model each user's queue as a separate G G 1 queue. We derive the probability distributions for the different delay sources, i.e., random back-off time, random number of collisions and random number of successful transmissions from other users. This user centric model can provide insights into understanding access and queuing delays in 802.11 DCF. Finally, we discuss the utility of these models for functions such as capacity analysis, admission control and QoS enforcement.