This paper introduces the distributed MAC protocol Jade. We consider a multi-hop wireless network with a single communication channel in which a powerful adversary is able to jam (groups of) nodes individually and during a (1 − )fraction of the entire time, where > 0 is an arbitrarily small constant. Despite this harsh environment, Jade exploits the few non-jammed slots effectively and guarantees a high throughput. Categories and Subject Descriptors C.2.5 [Computer-Communication Networks]: Local and Wide-Area Networks—Access Schemes; F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems—Sequencing and Scheduling General Terms Algorithms, Reliability, Theory Keywords Wireless Ad-hoc Networks, MAC Protocols, Jamming
Andréa W. Richa, Jin Zhang, Christian Schei