Towards Efficient Designs for In-network Computing with Noisy Wireless Channels

In this paper we study distributed function computation in a noisy multi-hop wireless network, in which n nodes are uniformly and independently distributed in a unit square. We adopt the adversarial noise model, for which independent binary symmetric channels are assumed for any point-to-point transmissions, with (not necessarily identical) crossover probabilities bounded above by some constant ¿. Each node holds an m-bit integer per instance...