Packet Latency of Deterministic Broadcasting in Adversarial Multiple Access Channels

TL;DR

This paper analyzes the worst-case packet latency and queue sizes in adversarial multi-access channels under deterministic broadcasting, considering constraints on packet injection and jamming.

Contribution

It provides upper bounds on latency and queue sizes for deterministic algorithms in adversarial environments with specific injection and jamming constraints.

Findings

Derived upper bounds on packet latency.

Established bounds on queue sizes.

Analyzed impact of adversarial constraints on performance.

Abstract

We study broadcasting in multiple access channels with dynamic packet arrivals and jamming. Communication environments are represented by adversarial models that specify constraints on packet arrivals and jamming. We consider deterministic distributed broadcast algorithms and give upper bounds on the worst-case packet latency and the number of queued packets in relation to the parameters defining adversaries. Packet arrivals are determined by a rate of injections and a number of packets that can be generated in one round. Jamming is constrained by a rate with which an adversary can jam rounds and by a number of consecutive rounds that can be jammed.