Sade: competitive MAC under adversarial SINR

Adrian Ogierman, Andrea Richa, Christian Scheideler, Stefan Schmid, Jin Zhang

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. So far, this problem is understood only in simplistic single-hop or unit disk graph models. We in this paper initiate the study of MAC protocols for the SINR interference model (a.k.a. physical model). This paper makes two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. Our second contribution is a distributed MAC protocol called Sade which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.

Original languageEnglish (US)
Pages (from-to)1-14
Number of pages14
JournalDistributed Computing
StateAccepted/In press - Jul 27 2017

ASJC Scopus subject areas

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


Dive into the research topics of 'Sade: competitive MAC under adversarial SINR'. Together they form a unique fingerprint.

Cite this