Broadcasting on Adversarial Multiple Access Channels

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

We consider broadcasting on multiple access channels under adversarial packet injection modeled by leaky-bucket adversaries. We study the impact of individual injection rates on latency, as compared to general leaky bucket adversaries. It is demonstrated 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. We give outcomes of simulations comparing the performance of broadcast algorithms against randomized adversaries, including comparisons to randomized backoff algorithms.

Original languageEnglish (US)
Title of host publication2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019
EditorsAris Gkoulalas-Divanis, Mirco Marchetti, Dimiter R. Avresky
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728125220
DOIs
StatePublished - Sep 2019
Event18th IEEE International Symposium on Network Computing and Applications, NCA 2019 - Cambridge, United States
Duration: Sep 26 2019Sep 28 2019

Publication series

Name2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019

Conference

Conference18th IEEE International Symposium on Network Computing and Applications, NCA 2019
Country/TerritoryUnited States
CityCambridge
Period9/26/199/28/19

Keywords

  • adversarial traffic
  • distributed broadcast
  • latency
  • multiple-access channel
  • stability

ASJC Scopus subject areas

  • Information Systems and Management
  • Computer Networks and Communications
  • Computer Science Applications
  • Safety, Risk, Reliability and Quality

Fingerprint

Dive into the research topics of 'Broadcasting on Adversarial Multiple Access Channels'. Together they form a unique fingerprint.

Cite this