On Distributed Computation inNoisyRandom
Planar Networks, Yashodhan KanonaandD · 2007
THISPAPERISELIGIBLEFOR THE STUDENT PAPERAWARD.We consider distributed computation offunc- tions ofdistributed datainrandomplanar networks withnoisy wireless links. We present anewalgorithm forcomputation of themaximumvaluewhichisorderoptimal inthenumberof transmissions andcomputation time. Wealso adapt thehistogram computation algorithm ofYingetal(1)tomakethehistogram computation timeoptimal.