Brief Announcement: Resource Competitive Broadcast against Adaptive Adversary in Multi-channel Radio Networks

Abstract

Broadcasting in wireless networks is vulnerable to adversarial jamming. To thwart such behavior, researchers have proposed resource competitive analysis. In this framework, sending, listening, or jamming on one channel for one time slot costs one unit of energy. The adversary can employ arbitrary strategy to disrupt communication, but has a limited energy budget T. The honest nodes, on the other hand, aim to accomplish broadcast while spending only o(T). Previous work has shown, in a C-channels network containing n nodes, each node can receive the message in roughly O(T/C) time, while spending only roughly [EQUATION] energy. However, these algorithms only work for C = O(n), and can only tolerate an oblivious adversary. We improve the result by considering an adaptive adversary and arbitrary values of n and C. In our algorithms, for large T values, each node's runtime is O(T/C), and each node's energy cost is [EQUATION]. The time complexity is asymptotically optimal, while the energy complexity is near optimal in some cases. We use "epidemic broadcast" with proper working probabilities to achieve time efficiency and resource competitiveness, and leverage coupling arguments in the analysis to handle the adaptivity of the adversary.