Date Added: Dec 2009
The authors study broadcasting on multiple access channels by deterministic distributed protocols. Data arrivals are governed by an adversary. The power of the adversary is constrained by the average rate of data injection and a bound on the number of different packets that can be injected in one round. The injection rate is at most 1, which forbids the adversary from overloading the channel. They consider a number of deterministic protocols. For each of them they give an upper bound on the worst-case packet latency, as a function of the constraints imposed on the adversary. They present results of experiments by simulations to compare packet latency of the deterministic protocols and of back-off-type randomized protocols.