Slotted ALOHA (source code)

= Slotted ALOHA

Time is divided into slots, and a slot succeeds exactly when one station transmits. With backlog $N$ and independent attempt probability $p$, the success probability is $Np(1-p)^{N-1}$. <Fluid approximation of slotted ALOHA> replaces the large-system binomial probabilities by Poisson probabilities.