Permanent collisions in constant-probability slotted ALOHA ($\mathbb{P}(\exists J:Z_t=\ast \forall t\ge J)=1$)

With independent Poisson arrivals of any positive rate and a fixed retry probability $0<f\le 1$, the infinite-population slotted ALOHA model eventually has collisions in every slot almost surely. For $f<1$, an exponential-supermartingale escape bound proves transience of the backlog chain. Bounded martingale increments then give backlog growth at the arrival rate, and the Conditional Borel-Cantelli lemma makes the exponentially unlikely noncollision slots finite in number. At $f=1$, two old packets suffice for permanent collisions. At $f=0$ the assertion is false.

In slotted ALOHA, let old packets retry independently with fixed probability $0<p<1$, and let independent Poisson random variables of mean $\nu >0$ transmit once on arrival. Write $q=1-p$ and $r=e^{-\nu p}$. A hypothetical process which never removes a packet has backlog $b+A_t$, where $A_t$ is the cumulative arrival count over $t$ slots. Couple its attempts to those of the actual process until the first noncollision. Its one-slot noncollision probability at backlog $n$ is $h(n)=e^{-\nu }[(1+\nu )q^n+np{q}^{n-1}]$. The union bound and the Poisson distribution giveIndeed $\mathbb{E}[q^{A_t}]=r^t$ and $\mathbb{E}[A_t{q}^{A_t}]=\nu tq{r}^t$. Thus $\epsilon (b)\to 0$. From every sufficiently large backlog, permanent collisions have probability at least $1/2$. Independent arrival batches reach that threshold almost surely; after each failed attempt the Strong Markov property permits another attempt. The probability of $k$ consecutive failures is at most $2^{-k}$, proving almost-sure eventual permanent collisions without assuming in advance that the backlog escapes.