On Distributed Computation in Noisy Random Planar Networks

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, 2 figures

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On Distributed Computation in Noisy Random Planar Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Distributed Computation in Noisy Random Planar Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Distributed Computation in Noisy Random Planar Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-184910

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.