Medium access control for adversarial channels with jamming

Authors:
Lakshmi Anantharamu;Bogdan S. Chlebus;Dariusz R. Kowalski;Mariusz A. Rokicki
Affiliations:
Department of Computer Science and Engineering, U. of Colorado Denver;Department of Computer Science and Engineering, U. of Colorado DenverDepartment of Computer Science and Engineering, U. of Colorado Denver;Department of Computer Science, University of Liverpool;Department of Computer Science, University of Liverpool
Venue:
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Year:
2011

Citing 12
Cited 1

Adversarial queuing theory

Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols

Journal of the ACM (JACM)
Adversarial models for priority-based networks

Networks
Adversarial contention resolution for simple channels

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Adversarial queuing on the multiple-access channel

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Routing and scheduling in multihop wireless networks with time-varying channels

ACM Transactions on Algorithms (TALG)
A jamming-resistant MAC protocol for single-hop wireless networks

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Of malicious motes and suspicious sensors

Theoretical Computer Science
Speed Dating Despite Jammers

DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Adversarial Multiple Access Channel with Individual Injection Rates

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Reliable Broadcast in Radio Networks with Locally Bounded Failures

IEEE Transactions on Parallel and Distributed Systems
Deterministic broadcast on multiple access channels

INFOCOM'10 Proceedings of the 29th conference on Information communications

Competitive and fair throughput for co-existing networks under adversarial interference

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.