A tight lower bound for parity in noisy communication networks


We show a tight lower bound of &#937;(<i>N</i> log log <i>N</i>) on the number of transmission required to compute the parity of <i>N</i> bits (with constant error) in a network of <i>N</i> randomly placed sensors, communicating using local transmissions, and operating with power near the connectivity threshold. This result settles a question left open by… (More)



Citations per Year

Citation Velocity: 11

Averaging 11 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.