Competitive throughput in multi-hop wireless networks despite adaptive jamming

Andrea Richa, Christian Scheideler, Stefan Schmid, Jin Zhang

Research output: Contribution to journalArticlepeer-review

21 Scopus citations


This article presents a simple local medium access control protocol, called Jade, for multi-hop wireless networks with a single channel that is provably robust against adaptive adversarial jamming. The wireless network is modeled as a unit disk graph on a set of nodes distributed arbitrarily in the plane. In addition to these nodes, there are adversarial jammers that know the protocol and its entire history and that are allowed to jam the wireless channel at any node for an arbitrary (1-ε)-fraction of the time steps, where 0 < ε <1 is an arbitrary constant. We assume that nodes can perform collision detection (unless they are transmitting themselves), but that they cannot distinguish between jammed transmissions and collisions of regular messages. Nevertheless, we show that Jade achieves an asymptotically optimal throughput by efficiently exploiting the unpredictable time periods in which the medium is available.

Original languageEnglish (US)
Pages (from-to)159-171
Number of pages13
JournalDistributed Computing
Issue number3
StatePublished - Jun 1 2013


  • Distributed algorithms
  • Jamming
  • Medium access
  • Randomization

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics


Dive into the research topics of 'Competitive throughput in multi-hop wireless networks despite adaptive jamming'. Together they form a unique fingerprint.

Cite this