On Distributed Computation in Noisy Random Planar Networks

THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We present a new algorithm for computation of the maximum value which is order optimal in the number of transmissions and computation time. We also adapt the histogram computation algorithm of Ying et al [1] to make the histogram computation time optimal.

• Type: Journal
• Year: 2007
• Where: CORR
• Authors: Yashodhan Kanoria, D. Manjunath
• Keywords: Computation, Computation Time, CORR 2007, Education, Histogram Computation