54 search results - page 1 / 11 » Lower Bounds for the Noisy Broadcast Problem |
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
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...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We consider the problem of deterministic broadcasting in radio networks when the nodes have limited knowledge about the topology of the network. We show that for every determinist...
COCOON
2004
Springer
13 years 10 months ago
2004
Springer
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
CORR
2010
Springer
13 years 4 months ago
2010
Springer
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...