WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

Random Key Graph

​
configuration
2
key ring size
4
key pool size
10
number of points
256
radius
0.1
show range disk
The random (geometric) key graph model is presented here. Each node randomly selects
k
keys from a pool of
p
keys and those keys form the key ring of each node. Two nodes within the given range
r
(the radius of the yellow disk) are connected if they share a common key in their key ring.
For example, suppose node
i
has the keys 1 and 2, node
j
has the keys 2 and 3, and node
k
has the keys 3 and 4. If
|i-j|≤r
,
i
and
j
are connected because they share the key 2. If
|i-j|>r
, they are not connected. If
|i-k|≤r
,
i
and
k
are not connected because they do not share a key.
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.