658 search results - page 71 / 132 » Lower bounds for sorting networks |
SIROCCO
2004
13 years 9 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper addresses the issue of network life during repeated broadcasts originating from the same source in large, strip-shaped wireless sensor networks. The proposed technique w...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
ACSAC
2010
IEEE
12 years 11 months ago
2010
IEEE
We present a quantitative lower bound on the number of vulnerable embedded device on a global scale. Over the past year, we have systematically scanned large portions of the inter...