Brief Encounters with a Random Key Graph

Virgil D. Gligor, Adrian Perrig, Jun Zhao

Abstract: Random key graphs, also called uniform random intersection graphs, have been used for modeling a variety of different applications since their introduction in wireless sensor networks. In this paper, we review some of their recent applications and suggest several new ones, under the full visibility assumption; i.e., under the assumption that all nodes are within communication range of each other. We also suggest further research in determining the connectivity properties of random key graphs when limited visibility is more realistic; e.g., graph nodes can communicate only with a subset of other nodes due to range restrictions or link failures.