Bounds for Packet Transmission Rate in a Random-Multiple-Access System

The article considers a system of random multiple access (RMA) of packets to a broadcast channel. It is assumed that a conflict is the superposition of transmission of $n$ or more packets. Most earlier studies have considered the case $n=2$. Upper and lower bounds are found for the capacity of a system with a large number of stations in relation to $n$, for Poisson incoming packet traffic.