Distributed Byzantine-Resilient Multiple-Message Dissemination in Wireless Networks

The byzantine model is widely used to depict a variety of node faults in networks. Previous studies on byzantine-resilient protocols in wireless networks assume reliable communications and do not consider the jamming behavior of byzantine nodes. Such jamming, however, is a very critical and realistic behavior to be considered in modern wireless networks. In this paper, for the first time, we integrate the jamming behavior of byzantine nodes into the network setting. We show that, in this much more comprehensive and harsh model, efficient distributed communication protocols can be still devised with elaborate protocol design. In particular, we developed an algorithm that can accomplish the basic multiple-message dissemination task close to the optimal solution in terms of running time. Empirical results validate the byzantine-resilience and efficiency of our algorithm.

Automated summary

The Byzantine model is widely used to depict various node faults in networks, and this paper integrates the jamming behavior of Byzantine nodes into the network setting for the first time. Despite the more comprehensive and harsh model, efficient distributed communication protocols can still be devised with elaborate protocol design. The developed algorithm demonstrates effective Byzantine resilience and efficiency in empirical results.