Modeling and analysis of stochastic systems
Modeling and analysis of stochastic systems
Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit
IEEE/ACM Transactions on Networking (TON)
Communication Networking: An Analytical Approach
Communication Networking: An Analytical Approach
Performance modelling and measurements of TCP transfer throughput in 802.11-based WLAN
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Modeling the 802.11 distributed coordination function in nonsaturated heterogeneous conditions
IEEE/ACM Transactions on Networking (TON)
New insights from a fixed-point analysis of single cell IEEE 802.11 WLANs
IEEE/ACM Transactions on Networking (TON)
Performance analysis under finite load and improvements for multirate 802.11
Computer Communications
A queueing model for HTTP traffic over IEEE 802.11 WLANs
Computer Networks: The International Journal of Computer and Telecommunications Networking
On a buffering hypothesis in 802.11 analytic models
IEEE Communications Letters
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
IEEE 802.11 protocol: design and performance evaluation of an adaptive backoff mechanism
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We study a State Dependent Attempt Rate (SDAR) approximation to model M queues (one queue per node) served by the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol as standardized in the IEEE 802.11 Distributed Coordination Function (DCF). The approximation is that, when n of the M queues are non-empty, the (transmission) attempt probability of each of the n non-empty nodes is given by the long-term (transmission) attempt probability of nsaturated nodes. With the arrival of packets into the M queues according to independent Poisson processes, the SDAR approximation reduces a single cell with non-saturated nodes to a Markovian coupled queueing system. We provide a sufficient condition under which the joint queue length Markov chain is positive recurrent. For the symmetric case of equal arrival rates and finite and equal buffers, we develop an iterative method which leads to accurate predictions for important performance measures such as collision probability, throughput and mean packet delay. We replace the MAC layer with the SDAR model of contention by modifying the NS-2 source code pertaining to the MAC layer, keeping all other layers unchanged. By this model-based simulation technique at the MAC layer, we achieve speed-ups (w.r.t. MAC layer operations) up to 5.4. Through extensive model-based simulations and numerical results, we show that the SDAR model is an accurate model for the DCF MAC protocol in single cells.