Competitive throughput in multi-hop wireless networks despite adaptive jamming

Andrea Richa, Christian Scheideler, Stefan Schmid, Jin Zhang

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

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
Volume26
Issue number3
DOIs
StatePublished - Jun 2013

Fingerprint

Multi-hop Wireless Networks
Jamming
Wireless networks
Throughput
Network protocols
Medium access control
Vertex of a graph
Unit Disk Graph
Collision Detection
Medium Access Control
Arbitrary
Asymptotically Optimal
Wireless Networks
Collision
Entire

Keywords

  • Distributed algorithms
  • Jamming
  • Medium access
  • Randomization

ASJC Scopus subject areas

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

Cite this

Competitive throughput in multi-hop wireless networks despite adaptive jamming. / Richa, Andrea; Scheideler, Christian; Schmid, Stefan; Zhang, Jin.

In: Distributed Computing, Vol. 26, No. 3, 06.2013, p. 159-171.

Research output: Contribution to journalArticle

Richa, Andrea ; Scheideler, Christian ; Schmid, Stefan ; Zhang, Jin. / Competitive throughput in multi-hop wireless networks despite adaptive jamming. In: Distributed Computing. 2013 ; Vol. 26, No. 3. pp. 159-171.
@article{91a6d4b1ecdc49d98e2ed4c525be3564,
title = "Competitive throughput in multi-hop wireless networks despite adaptive jamming",
abstract = "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.",
keywords = "Distributed algorithms, Jamming, Medium access, Randomization",
author = "Andrea Richa and Christian Scheideler and Stefan Schmid and Jin Zhang",
year = "2013",
month = "6",
doi = "10.1007/s00446-012-0180-x",
language = "English (US)",
volume = "26",
pages = "159--171",
journal = "Distributed Computing",
issn = "0178-2770",
publisher = "Springer Verlag",
number = "3",

}

TY - JOUR

T1 - Competitive throughput in multi-hop wireless networks despite adaptive jamming

AU - Richa, Andrea

AU - Scheideler, Christian

AU - Schmid, Stefan

AU - Zhang, Jin

PY - 2013/6

Y1 - 2013/6

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

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

KW - Distributed algorithms

KW - Jamming

KW - Medium access

KW - Randomization

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

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

U2 - 10.1007/s00446-012-0180-x

DO - 10.1007/s00446-012-0180-x

M3 - Article

AN - SCOPUS:84878959148

VL - 26

SP - 159

EP - 171

JO - Distributed Computing

JF - Distributed Computing

SN - 0178-2770

IS - 3

ER -