On Distributed Function Computation in Structure-Free Random Networks

Details On Distributed Function Computation in Structure-Free Random Networks On Distributed Function Computation in Structure-Free Random Networks

2008-05-05

arxiv.org/abs/0805.0337v1

Computer Science

Information Theory

13 pages, 1 figure. Accepted at IEEE International Symposium on Information Theory 2008

Scientific paper

We consider in-network computation of MAX in a structure-free random multihop wireless network. Nodes do not know their relative or absolute locations and use the Aloha MAC protocol. For one-shot computation, we describe a protocol in which the MAX value becomes available at the origin in $O(\sqrt{n/\log n})$ slots with high probability. This is within a constant factor of that required by the best coordinated protocol. A minimal structure (knowledge of hop-distance from the sink) is imposed on the network and with this structure, we describe a protocol for pipelined computation of MAX that achieves a rate of $\Omega(1/(\log^2 n)).$

Affiliated with

Also associated with

No associations

Rating

On Distributed Function Computation in Structure-Free Random 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 Function Computation in Structure-Free Random Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Distributed Function Computation in Structure-Free Random Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-208306