Sade: competitive MAC under adversarial SINR

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

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

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
DOIs
StateAccepted/In press - Jul 27 2017

Fingerprint

MAC Protocol
Interference
Unit Disk Graph
Distributed Protocol
Jamming
Graph Model
Physical Model
Wave interference
Throughput
Arbitrary
Vertex of a graph
Energy
Model
Range of data

ASJC Scopus subject areas

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

Cite this

Ogierman, A., Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (Accepted/In press). Sade: competitive MAC under adversarial SINR. Distributed Computing, 1-14. https://doi.org/10.1007/s00446-017-0307-1

Sade : competitive MAC under adversarial SINR. / Ogierman, Adrian; Richa, Andrea; Scheideler, Christian; Schmid, Stefan; Zhang, Jin.

In: Distributed Computing, 27.07.2017, p. 1-14.

Research output: Contribution to journalArticle

Ogierman, Adrian ; Richa, Andrea ; Scheideler, Christian ; Schmid, Stefan ; Zhang, Jin. / Sade : competitive MAC under adversarial SINR. In: Distributed Computing. 2017 ; pp. 1-14.
@article{b4d77bb4e55040769bda8d668c3a2a9c,
title = "Sade: competitive MAC under adversarial SINR",
abstract = "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.",
author = "Adrian Ogierman and Andrea Richa and Christian Scheideler and Stefan Schmid and Jin Zhang",
year = "2017",
month = "7",
day = "27",
doi = "10.1007/s00446-017-0307-1",
language = "English (US)",
pages = "1--14",
journal = "Distributed Computing",
issn = "0178-2770",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Sade

T2 - competitive MAC under adversarial SINR

AU - Ogierman, Adrian

AU - Richa, Andrea

AU - Scheideler, Christian

AU - Schmid, Stefan

AU - Zhang, Jin

PY - 2017/7/27

Y1 - 2017/7/27

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85026894990&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85026894990&partnerID=8YFLogxK

U2 - 10.1007/s00446-017-0307-1

DO - 10.1007/s00446-017-0307-1

M3 - Article

AN - SCOPUS:85026894990

SP - 1

EP - 14

JO - Distributed Computing

JF - Distributed Computing

SN - 0178-2770

ER -