We study a fixed point 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 resulting from it are studied. Uniqueness of the fixed point is established. Simple and general throughput formulas are provided. It is shown that the throughput of any flow will be bounded by the one with the smallest transmission rate. The aggregate throughput is bounded by the reciprocal of the harmonic mean of the transmission rates. In an asymptotic regime with a large number 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 back-off process. It is shown how the saturated network analysis can be used to obtain TCP transfer throughputs in some cases.
[1]
Byung-Jae Kwak,et al.
Analysis of the stability and performance of exponential backoff
,
2003,
2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..
[2]
Martin Heusse,et al.
Performance anomaly of 802.11b
,
2003,
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[3]
Marco Conti,et al.
IEEE 802.11 protocol: design and performance evaluation of an adaptive backoff mechanism
,
2000,
IEEE Journal on Selected Areas in Communications.
[4]
Anurag Kumar,et al.
Stability and throughput analysis of unslotted CDMA‐ALOHA with finite number of users and code sharing
,
1997,
Telecommun. Syst..