On the upper bound of transmission unreliability in memoryless backoff contention
Marek Miśkowicz, Dariusz Kościelnik · 2010
The paper addresses the problem of evaluating the unreliability of transmission, undertaken by a given station according to the CSMA scheme with the memoryless backoff and uniform probability distribution for choosing the contention slots. The analysis is carried out both for the unified backoff and multiple backoff contention. The presented results show that the upper bound on the transmission unreliability of a given station is paradoxically independent of the number of contending stations both for the unified backoff and for the multiple backoff. These results are conflicting with the intuitive expectation that the chance to transmit successfully using a given number of contention slots decreases with the number of the contenders.