Sciweavers

862 search results - page 22 / 173
» Random Information Spread in Networks
Sort
View
CMS
2006
15 years 1 months ago
TAO: Protecting Against Hitlist Worms Using Transparent Address Obfuscation
Abstract. Sophisticated worms that use precomputed hitlists of vulnerable targets are especially hard to contain, since they are harder to detect, and spread at rates where even au...
Spyros Antonatos, Kostas G. Anagnostakis
ADHOCNETS
2009
Springer
15 years 6 months ago
Error Correction with the Implicit Encoding Capability of Random Network Coding
—We introduce a novel error correction scheme that uses the implicit encoding capability of Random Network Coding. This scheme does not add redundancy to the data prior to transm...
Suné von Solms, Magdalena J. Grobler, Alber...
CORR
2007
Springer
115views Education» more  CORR 2007»
14 years 11 months ago
Random Linear Network Coding: A free cipher?
Abstract— We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols y...
Luísa Lima, Muriel Médard, Joã...
WIOPT
2006
IEEE
15 years 5 months ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi
BIOCOMP
2006
15 years 1 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer