vix.ing · top · new · best · stats · spec

Competitive MAC under Adversarial SINR

2013/07/27 by Adrian Ogierman, Ogierman, Adrian, Andréa W. Richa +8
Computer Science · #C.2.4 #F.2.2 #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks #Security in Wireless Sensor Networks #cs.NI

paper · pdf · doi:10.48550/arxiv.1307.7231

arXiv admin note: text overlap with arXiv:1007.1189

arxiv created 2013/07/27 · openalex publication_date 2013/07/27 · arxiv updated 2013/07/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. While this problem has already been studied intensively for simplistic single-hop or unit disk graph models, we make a leap forward and study MAC protocols for the SINR interference model (a.k.a. the physical model). We make two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. The second contribution of this paper is a distributed MAC protocol which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.

Citations

Related