Component evolution in a secure wireless sensor network
Abstract
We study a connectivity property of a secure wireless network that uses random pre‐distribution of keys. A network is composed of n sensors. Each sensor is assigned a collection of d different keys drawn uniformly at random from a given set of m keys. Two sensors are joined by a communication link if they share a common key. We show that for large n with high probability the connected component of size Ω(n) emerges in the network when the probability of a link exceeds the threshold 1/n. Similar component evolution is shown for networks where sensors communicate if they share at least s common keys. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009Keywords
This publication has 5 references indexed in Scilit:
- Component Evolution in Random Intersection GraphsThe Electronic Journal of Combinatorics, 2007
- Two Models of Random Intersection Graphs for Classification2003
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) modelsRandom Structures & Algorithms, 2000
- Random Graphs2000
- On Random Intersection Graphs: The Subgraph ProblemCombinatorics, Probability and Computing, 1999