43 search results - page 1 / 9 » Percolation in the Secrecy Graph |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
— 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 ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
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...
CPC
2010
13 years 2 months ago
2010
We consider first-passage percolation on a ladder, i.e. the graph N
STOC
2002
ACM
14 years 5 months ago
2002
ACM
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...