Towards jamming-resistant and competitive medium access in the SINR model
S3 '11 Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students
Self-stabilizing leader election for single-hop wireless networks despite jamming
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Making evildoers pay: resource-competitive broadcast in sensor networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Competitive and fair throughput for co-existing networks under adversarial interference
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Resource-competitive analysis: a new perspective on attack-resistant distributed computing
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
Distributed online and stochastic queuing on a multiple access channel
DISC'12 Proceedings of the 26th international conference on Distributed Computing
SybilCast: broadcast on the open airwaves (extended abstract)
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often simple and cheap to implement. Today's jammers can perform physical carrier sensing in order to disrupt communication more efficiently, especially in a network of simple wireless devices such as sensor nodes, which usually operate over a single frequency (or a limited frequency band) and which cannot benefit from the use of spread spectrum or other more advanced technologies. This paper proposes the medium access (MAC) protocol \textsc{Anti Jam} which is provably robust against a powerful reactive adversary who can jam a $(1-\varepsilon)$-portion of the time steps, where $\varepsilon$ is an arbitrary constant. The adversary uses carrier sensing to make informed decisions on when it is most harmful to disrupt communications. Moreover, we allow the adversary to be adaptive and to have complete knowledge of the entire protocol history. Our MAC protocol is able to make efficient use of the non jammed time periods and achieves a $\Theta{(1)}$-competitive throughput in this harsh scenario, if $\varepsilon$ is constant. In addition, \textsc{Anti Jam} features a low convergence time and has excellent fairness properties in the sense that channel access probabilities among nodes do not differ by more than a small constant factor.