On Distributed Function Computation in Structure-Free Random Networks
Information Theory
2008-05-06 v1 math.IT
Abstract
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 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
Cite
@article{arxiv.0805.0337,
title = {On Distributed Function Computation in Structure-Free Random Networks},
author = {Sudeep Kamath and D. Manjunath},
journal= {arXiv preprint arXiv:0805.0337},
year = {2008}
}
Comments
13 pages, 1 figure. Accepted at IEEE International Symposium on Information Theory 2008