Binary exponential backoff
= Binary exponential backoff
After $k$ collisions a packet chooses an independent counter uniformly from $\{0,\ldots,2^k-1\}$ and retries when it expires. The window doubles after a further collision. This is an example of <exponential backoff> with a nonconstant retry rule, contrasting with constant-probability <slotted ALOHA>.