Date Added: Aug 2009
In this paper, the authors study distributed function computation in a noisy multi-hop wireless network, in which n nodes are uniformly and independently distributed in a unit square. Each node holds an m-bit integer per instance and the computation is started after each node collects N readings. The goal is to compute a global function with a certain fault tolerance, in this distributed setting; they mainly deal with divisible functions, which essentially covers the main body of interest for wireless applications. They focus on protocol designs that are efficient in terms of communication complexity.