Zero-One Laws for Connectivity in Inhomogeneous Random Key Graphs

摘要: We introduce a new random key predistribution scheme for securing heterogeneous wireless sensor networks. Each of the $n$ sensors in network is classified into $r$ classes according to some probability distribution $\boldsymbol {\mu }=\{\mu _{1},\ldots ,\mu _{r}\}$ . Before deployment, class- $i$ assigned $K_{i}$ cryptographic keys that are selected uniformly at from common pool $P$ keys. Once deployed, pair can communicate securely if and only they have common. model communication topology this by newly defined inhomogeneous graph. establish scaling conditions on parameters $\{K_{1},\ldots , K_{r}\}$ so graph: 1) has no isolated nodes 2) connected, both with high probability. The results given form zero-one laws number growing unboundedly large; critical scalings identified shown coincide graph properties. Our complement improve those Godehardt et al. Zhao same model, therein referred as general intersection