Lower Bounds for Noisy Wireless Networks using Sampling Algorithms

FOCS, pp. 394-402, 2008.

Cited by: 4|Views5
EI WOS

Abstract:

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

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments