We study deterministic distributed algorithms for broadcasting on multiple-access channels. Packet injection is modeled by leaky-bucket adversaries. There is a fixed set of stations attached to a channel. Additional features of the model of communication include an upper bound on the number of stations activated in a round, an individual injection rate, and randomness in generating and injecting packets. We demonstrate that some broadcast algorithms designed for ad-hoc channels have bounded latency for increased ranges of injection rates than in ad-hoc channels 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 deterministic algorithms and randomized backoff algorithms.

翻译：本研究探讨了在多址信道上进行广播的确定性分布式算法。数据包注入采用漏桶对手模型进行建模。信道连接着一个固定的站点集合。该通信模型的其他特征包括每轮激活站点数量的上限、个体注入速率，以及在生成和注入数据包过程中的随机性。我们证明，当在固定站点数量的信道上执行时，针对每轮最多只能激活一个站点的对手，一些为自组织信道设计的广播算法在比自组织信道更宽的注入速率范围内具有有限延迟。与通用漏桶对手模型相比，个体注入速率被证明会影响延迟。文中给出了实验的结果，这些实验比较了广播算法在随机对手下的性能。实验包括确定性算法和随机退避算法。