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

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

Top
Authors
• Richa, Andrea
• Scheideler, Christian
• Schmid, Stefan
• Zhang, Jin
Top
Supplemental Material
Shortfacts
 Category Journal Paper Divisions Subjects Journal or Publication Title Distributed Computing ISSN 0178-2770 Date 2013 Export BibTeX ASCII Citation DIDL Dublin Core EP3 XML EP3 XML with files embedded EndNote Eprints Application Profile HTML Citation JSON METS MODS Multiline CSV OAI-ORE Resource Map (Atom Format) OAI-ORE Resource Map (RDF Format) OpenURL ContextObject RDF+N-Triples RDF+N3 RDF+XML Refer Reference Manager Simple Metadata
Top