Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
FOCS, pp. 394-402, 2008.
We show a tight lower bound of Omega(Nloglog N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a network of N randomly placed sensors, communicating using local transmissions, and operating with power near the connectivity threshold. This result considerabl...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)