Packet latency of deterministic broadcasting in adversarial multiple access channels

Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki

Research output: Contribution to journalArticle

4 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)27-52
Number of pages26
JournalJournal of Computer and System Sciences
Volume99
DOIs
StatePublished - Feb 2019
Externally publishedYes

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Packet latency of deterministic broadcasting in adversarial multiple access channels'. Together they form a unique fingerprint.

  • Cite this