Abstrmt-We study a fixed pcht formalisation of the well known analysis of Bianchi. We provide a significant simplification and generalisation of the analysis. In this more general framework, the fixed point solution and performance measures resuiting from it are studied. Uniqueness of the Bxed point is established. Simple and general throughput formulas are provided. It is shown that the throughput of any Row will he bounded by the one with the smallest transmission rate. The aggregate throughput is bounded hy the reciprocal of the harmonic mean of the transmission rates. In an asymptotic regime with a large numher of nodes, explicit formulas for the collision probability, the aggregate attempt rate and the aggregate throughput are provided, The results from the analysis are compared with ns2 simulations, and also with an exact Markov model of the backoff process. It is shown how the saturated network analysis can be used to obtain TCP transfer throughputs in some cases.
The authors of REF used a renewal theory to develop a fixed-point formulation relating the per-station attempt rate with the collision probability of a packet under saturation.
New insights from a fixed point analysis of single cell IEEE 802.11 WLANs
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Computer Science Mathematics