We study broadcasting on multiple-access channels under adversarial packet injection. Leaky-bucket adversaries model packet injection. There is a fixed set of stations attached to a channel. Additional constrains on the model include bounds on the number of stations activated at a round, individual injection rates, and randomness in generating and injecting packets. Broadcast algorithms that we concentrate on are deterministic and distributed. We demonstrate 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. Individual injection rates are shown to impact latency, as compared to the model of general leaky bucket adversaries. Outcomes of experiments are given that compare the performance of broadcast algorithms against randomized adversaries. The experiments include randomized backoff algorithms.

翻译：我们研究在对抗性包装注射下通过多进入渠道进行广播。 Leaky-bucket对手模型注射。有一套固定的台站附在一个频道上。模型的附加限制包括一个圆形、单体注射率、以及生成和注射包随机抽取的台站数目的界限。我们集中研究的广播算法是确定性的并分布的。我们证明,一些专为专用频道设计的广播算法,在有固定数量的台站执行时,与范围更广的注射率相连接,因为有固定数量的台站执行的注射率可以对抗最多可以每轮启动一个台站的对手。个人注射率与一般漏水桶对手模式相比,显示出对耐用率的影响。实验结果比较了广播算法对随机对手的表现。实验包括随机反向算法。