On Distributed Function Computation in Structure-Free Random Wireless Networks

Volume: 60, Issue: 1, Pages: 432 - 442
Published: Jan 1, 2014
Abstract
We consider in-network computation of MAX and the approximate histogram in an n-node structure-free random multihop wireless network. The key assumption that we make is that the nodes do not know their relative or absolute locations and that they do not have an identity. For the Aloha MAC protocol, we first describe a protocol in which the MAX value becomes available at the origin in O(√{n/logn}) slots (bit-periods) with high probability. This...
Paper Details
Title
On Distributed Function Computation in Structure-Free Random Wireless Networks
Published Date
Jan 1, 2014
Volume
60
Issue
1
Pages
432 - 442
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.