Packet latency of deterministic broadcasting in adversarial multiple access channels

https://doi.org/10.1016/j.jcss.2018.07.001Get rights and content
Under an Elsevier user license
open archive

Highlights

  • Dynamic broadcasting on a multiple access channel.

  • Packets injected continuously by an adversary constrained by the injection rate and burstiness.

  • Algorithms are deterministic.

  • Performance measured by the worst-case packet latency and queue sizes.

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.

Keywords

Multiple access channel
Adversarial queuing
Jamming
Distributed algorithm
Deterministic algorithm
Packet latency
Queues size

Cited by (0)

1

The work was supported by the National Science Foundation under Grant No. 1016847.

2

The work was supported by Narodowe Centrum Nauki under Grant No. UMO-2017/25/B/ST6/02553.