Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CORR
2007
Springer

favoriteEmaildiscussreport

123views Education» more CORR 2007»

On Distributed Computation in Noisy Random Planar Networks

13 years 4 months ago

On Distributed Computation in Noisy Random Planar Networks

Download dspace.library.iitb.ac.in

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.

Yashodhan Kanoria, D. Manjunath

Real-time Traffic

Computation | Computation Time | CORR 2007 | Education | Histogram Computation |

claim paper

Related Content

» On Gazit and Millers Parallel Algorithm for Planar Separators Achieving Greater Efficiency...

» Anytime Reliable Transmission of RealValued Information through Digital Noisy Channels

» The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization

» A coding theorem for distributed computation

» Distributed constrained optimization over noisy networks

» Nonparametric belief propagation for distributed tracking of robot networks with noisy int...

» Distributed Node Selection for Sequential Estimation over Noisy Communication Channels

» Geographic Gossip Efficient Averaging for Sensor Networks

» Protecting Circuits from Leakage the ComputationallyBounded and Noisy Cases

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	Yashodhan Kanoria, D. Manjunath

Comments (0)