In slotted ALOHA, let old packets retry independently with fixed probability , and let independent Poisson random variables of mean transmit once on arrival. Write and . A hypothetical process which never removes a packet has backlog , where is the cumulative arrival count over slots. Couple its attempts to those of the actual process until the first noncollision. Its one-slot noncollision probability at backlog is . The union bound and the Poisson distribution giveIndeed and . Thus . From every sufficiently large backlog, permanent collisions have probability at least . Independent arrival batches reach that threshold almost surely; after each failed attempt the Strong Markov property permits another attempt. The probability of consecutive failures is at most , proving almost-sure eventual permanent collisions without assuming in advance that the backlog escapes.
Articles by others on the same topic
There are currently no matching articles.