Competitive throughput in multihop wireless netwo

Authors: Andrea Richa Christian Scheideler Stefan Schmid Jin Zhang

Publish Date: 2012/09/11

Volume: 26, Issue: 3, Pages: 159-171

PDF Link

Abstract

This article presents a simple local medium access control protocol called Jade for multihop 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 1epsilon fraction of the time steps where 0epsilon 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 availableA preliminary version of this article appeared at the 24th International Symposium on Distributed Computing DISC 2010 Research is partly supported by NSF grants CCF1116368 and CCF0830704 as well as by DFG grants DFG SFB 901 and DFG SCHE 1592/21

Keywords: