Distributed Computing

, Volume 26, Issue 3, pp 159–171

Competitive throughput in multi-hop wireless networks despite adaptive jamming

  • Andrea Richa
  • Christian Scheideler
  • Stefan Schmid
  • Jin Zhang
Article

DOI: 10.1007/s00446-012-0180-x

Cite this article as:
Richa, A., Scheideler, C., Schmid, S. et al. Distrib. Comput. (2013) 26: 159. doi:10.1007/s00446-012-0180-x

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-\epsilon )\)-fraction of the time steps, where \(0<\epsilon <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

Medium access Jamming Distributed algorithms Randomization 

Copyright information

© Springer-Verlag 2012

Authors and Affiliations

  • Andrea Richa
    • 1
  • Christian Scheideler
    • 2
  • Stefan Schmid
    • 3
  • Jin Zhang
    • 1
  1. 1.Computer Science and Engineering, SCIDSEArizona State UniversityTempeUSA
  2. 2.Universität PaderbornPaderbornGermany
  3. 3.Telekom Innovation Laboratories (T-Labs)Technische Universität BerlinBerlinGermany

Personalised recommendations