Sciweavers

43 search results - page 1 / 9
» Percolation in the Secrecy Graph
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 1 months ago
Percolation in the Secrecy Graph
— Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely ...
Amites Sarkar, Martin Haenggi
92
Voted
CORR
2008
Springer
139views Education» more  CORR 2008»
14 years 10 months ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 10 months ago
Continuum Percolation in the Intrinsically Secure Communications Graph
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
Pedro C. Pinto, Moe Z. Win
CPC
2010
95views more  CPC 2010»
14 years 7 months ago
First-Passage Percolation with Exponential Times on a Ladder
We consider first-passage percolation on a ladder, i.e. the graph N
Henrik Renlund
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
15 years 10 months ago
Clairvoyant scheduling of random walks
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
Péter Gács