Tree-Based Multiaccess Protocols Where Collision Multiplicities Are Known

We compute the stability region and mean packet delay for a class of tree-based, multiaccess protocols proposed recently in the literature for an ALOHA-type channel when collision multiplicities are known, and Show that within the stability region, all the moments of the delay distribution are finite. We also show that the main advantage, of knowing the collision multiplicities is being able, in effect, to detect conflicts in two groups in a single slot.