Broadcasting on Adversarial Multiple Access Channels

We consider broadcasting on multiple access channels under adversarial packet injection modeled by leaky-bucket adversaries. We study the impact of individual injection rates on latency, as compared to general leaky bucket adversaries. It is demonstrated that some broadcast algorithms designed for ad-hoc channels have bounded latency for wider ranges of injection rates when executed on channels with a fixed number of stations against adversaries that can activate at most one station per round. We give outcomes of simulations comparing the performance of broadcast algorithms against randomized adversaries, including comparisons to randomized backoff algorithms.