Computer Science – Information Theory
Scientific paper
2007-12-25
Proceedings of IEEE International Symposium on Information Theory, 2007
Computer Science
Information Theory
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.
Kanoria Yashodhan
Manjunath D.
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-184910