50 search results - page 10 / 10 » On the bit communication complexity of randomized rumor spre... |
ACSC
2008
IEEE
13 years 11 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
SIGMETRICS
2008
ACM
13 years 5 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
WISEC
2010
ACM
13 years 10 months ago
2010
ACM
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF) and decode-and-forward (DF) cooperative network...
MOBIHOC
2008
ACM
14 years 4 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...