On Distributed Computation in Noisy Random Planar Networks

TL;DR

This paper introduces new algorithms for distributed computation in noisy random planar networks, achieving order-optimal performance in transmission and computation time for functions like maximum and histograms.

Contribution

It presents a novel algorithm for maximum value computation and adapts existing histogram algorithms to optimize their computation time in noisy planar networks.

Findings

Maximum computation is order optimal in transmissions and time.

Histogram computation time is optimized using adapted algorithms.

Algorithms perform efficiently in noisy wireless planar networks.

Abstract

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 to make the histogram computation time optimal.