2 problems
- 0 votes0 replies1 view
The one-law for k-connectivity in inhomogeneous random key graphs with unreliable links
Let denote the intersection of an inhomogeneous random key graph and an Erdős–Rényi graph, with class probability distribution…
- 0 votes0 replies0 views
EG secure connectivity conjecture for random key-geometric graphs
Let sensor nodes be distributed in a disk of unit area, with transmission range , and let denote the probability that two nodes in the Eschenauer–Gligor key d…