Medium Access Control for Adversarial Channels with Jamming

We study broadcasting on multiple access channels with dynamic packet arrivals and jamming. The presented protocols are for the medium-access-control layer. The mechanisms of timing of packet arrivals and determination of which rounds are jammed are represented by adversarial models. Packet arrivals are constrained by the average rate of injections and the number of packets that can arrive in one round. Jamming is constrained by the rate with which the adversary can jam rounds and by the number of consecutive rounds that can be jammed. Broadcasting is performed by deterministic distributed protocols. We give upper bounds on worst-case packet latency of protocols in terms of the parameters defining adversaries. Experiments include both deterministic and randomized protocols. A simulation environment we developed is designed to represent adversarial properties of jammed channels understood as restrictions imposed on adversaries.

[1]  Maria J. Serna,et al.  Adversarial Models for Priority-Based Networks , 2003, MFCS.

[2]  Xin Liu,et al.  Performance of IEEE 802.11 under Jamming , 2008, Mobile Networks and Applications.

[3]  Bogdan S. Chlebus,et al.  Adversarial Multiple Access Channel with Individual Injection Rates , 2009, OPODIS.

[4]  Stefan Schmid,et al.  Speed Dating Despite Jammers , 2009, DCOSS.

[5]  Nitin H. Vaidya,et al.  Reliable Broadcast in Radio Networks with Locally Bounded Failures , 2010, IEEE Transactions on Parallel and Distributed Systems.

[6]  Michael A. Bender,et al.  Adversarial contention resolution for simple channels , 2005, SPAA '05.

[7]  Christian Scheideler,et al.  A jamming-resistant MAC protocol for single-hop wireless networks , 2008, PODC '08.

[8]  Baruch Awerbuch,et al.  Universal-stability results and performance bounds for greedy contention-resolution protocols , 2001, JACM.

[9]  Nitin H. Vaidya,et al.  Reliable Broadcast in Wireless Networks with Probabilistic Failures , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[10]  Dariusz R. Kowalski,et al.  Adversarial Queuing on the Multiple Access Channel , 2012, TALG.

[11]  Dariusz R. Kowalski,et al.  Deterministic Broadcast on Multiple Access Channels , 2010, 2010 Proceedings IEEE INFOCOM.

[12]  Allan Borodin,et al.  Adversarial queuing theory , 2001, JACM.

[13]  Rachid Guerraoui,et al.  Interference-Resilient Information Exchange , 2009, IEEE INFOCOM 2009.

[14]  Dariusz R. Kowalski,et al.  Maximum throughput of multiple access channels in adversarial environments , 2017, Distributed Computing.

[15]  Lisa Zhang,et al.  Routing and scheduling in multihop wireless networks with time-varying channels , 2004, SODA '04.

[16]  Rachid Guerraoui,et al.  Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks , 2009, Theor. Comput. Sci..