Sciweavers

108 search results - page 6 / 22
» Spreading of Messages in Random Graphs
Sort
View
BERTINORO
2005
Springer
14 years 28 days ago
Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
Niloy Ganguly, Lutz Brusch, Andreas Deutsch
CLUSTER
2006
IEEE
14 years 1 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...
CN
2010
121views more  CN 2010»
13 years 4 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
MMSEC
2006
ACM
132views Multimedia» more  MMSEC 2006»
14 years 1 months ago
On achievable security levels for lattice data hiding in the known message attack scenario
This paper presents a theoretical security analysis of lattice data hiding. The security depends on the secrecy of a dither signal that randomizes the codebook. If the same secret...
Luis Pérez-Freire, Fernando Pérez-Go...
ACSAC
2010
IEEE
13 years 5 months ago
Defending DSSS-based broadcast communication against insider jammers via delayed seed-disclosure
Spread spectrum techniques such as Direct Sequence Spread Spectrum (DSSS) and Frequency Hopping (FH) have been commonly used for anti-jamming wireless communication. However, trad...
An Liu, Peng Ning, Huaiyu Dai, Yao Liu, Cliff Wang