The radio network model is a well-studied abstraction for modeling wireless multi-hop networks. However, radio networks make the strong assumption that messages are delivered deterministically. The recently introduced noisy radio network model relaxes this assumption by dropping messages independently at random. In this work we quantify the relative computational power of noisy radio networks and classic radio networks. In particular, given a protocol for a fixed radio network we show how to reliably simulate this protocol if noise is introduced with a multiplicative cost of poly(log ∆, log log n) rounds where n is the number nodes in the network and ∆ is the max degree. For this result we make the simplifying assumption that the simulated protocol is static. Moreover, we demonstrate that, even if the simulated protocol is not static, it can be simulated with a multiplicative O(∆ log ∆) cost in the number of rounds. Lastly, we argue that simulations with a multiplicative overhead of o(log ∆) are unlikely to exist by proving that an Ω(log ∆) multiplicative round overhead is necessary under certain natural assumptions.
Further, CensorHillel et al. REF show how to simulate radio network protocols over noisy radio networks with high probability, with overhead poly(log ∆, log log n) for non-adaptive protocols, and O(∆ log 2 ∆) for any protocol.
Erasure Correction for Noisy Radio Networks
ArXiv
ArXiv
Mathematics Computer Science