A tight lower bound for parity in noisy communication networks
SODA, pp. 1056-1065, 2008.
We show a tight lower bound of Ω(N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors, communicating using local transmissions, and operating with power near the connectivity threshold. This result settles a question left open by Ying, Srikant a...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)