Fast Distributed Backbone Construction Despite Strong Adversarial Jamming

This paper studies jamming-resilient distributed backbone construction in multi-hop wireless networks. Specifically, a strong adversarial jamming model is proposed that captures the general jamming phenomena suffered by wireless communications. The jamming model is based on the realistic Signal-to-Interference-plus-Noise-Ratio (SINR) interference model, and is featured by local-uniformity, unrestricted energy budget and reactivity, which covers more jamming scenarios and is much closer to reality than existing jamming models. Under the strong adversarial jamming model, we propose a randomized distributed algorithm that can construct a backbone in $\mathcal{J} (O(\log n + \log R))$ rounds with high probability, where $\mathcal{J} (O(\log n + \log R))$ is the number of rounds in the interval from the beginning of the algorithm execution that contains $O(\log n + \log R)$ unjammed rounds for every node. This result is asymptotically optimal considering the trivial lower bound of $\Omega (\log n)$ for a successful transmission even without interference and jamming.