State dependent attempt rate modeling of single cell IEEE 802.11 WLANs with homogeneous nodes and Poisson arrivals

  • Authors:
  • Manoj K. Panda;Anurag Kumar

  • Affiliations:
  • ECE Department, Indian Institute of Science, Bangalore;ECE Department, Indian Institute of Science, Bangalore

  • Venue:
  • COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Analytical models of IEEE 802.11-based WLANs are invariably based on approximations, such as the well-known mean-jield approximations proposed by Bianchi for saturated nodes. In this paper, we provide a new approach for modeling the situation when the nodes are not saturated. We study a State Dependent Attempt Rate (SDAR) approximation to model M queues (one queue per node) served by the CSMA/CA protocol as standardized in the IEEE 802.11 DCF. The approximation is that, when n of the Mqueues are non-empty, the attempt probability of the n non-empty nodes is given by the long-term attempt probability of n saturated nodes as provided by Bianchi's model. This yields a coupled queue system. When packets arrive to the M queues according to independent Poisson processes, we provide an exact model for the coupled queue system with SDAR service. The main contribution of this paper is to provide an analysis of the coupled queue process by studying a lower dimensional process and by introducing a certain conditional independence approximation. We show that the numerical results obtained from our finite buffer analysis are in excellent agreement with the corresponding results obtained from ns-2 simulations. We replace the CSMA/CA protocol as implemented in the ns-2 simulator with the SDAR service model to show that the SDAR approximation provides an accurate model for the CSMA/CA protocol. We also report the simulation speed-ups thus obtained by our model-based simulation.