Related papers: k-Connectivity of Random Key Graphs
Random key graphs form a class of random intersection graphs and are naturally induced by the random key predistribution scheme of Eschenauer and Gligor for securing wireless sensor network (WSN) communications. Random key graphs have…
Random K-out graphs are used in several applications including modeling by sensor networks secured by the random pairwise key predistribution scheme, and payment channel networks. The random K-out graph with $n$ nodes is constructed as…
In a random key graph (RKG) of $n$ nodes each node is randomly assigned a key ring of $K_n$ cryptographic keys from a pool of $P_n$ keys. Two nodes can communicate directly if they have at least one common key in their key rings. We assume…
We consider secure and reliable connectivity in wireless sensor networks that utilize a heterogeneous random key predistribution scheme. We model the unreliability of wireless links by an on-off channel model that induces an…
A \emph{uniform random intersection graph} $G(n,m,k)$ is a random graph constructed as follows. Label each of $n$ nodes by a randomly chosen set of $k$ distinct colours taken from some finite set of possible colours of size $m$. Nodes are…
We study the secure and reliable connectivity of wireless sensor networks. Security is assumed to be ensured by the random pairwise key predistribution scheme of Chan, Perrig, and Song, and unreliable wireless links are represented by…
Random graphs are an important tool for modelling and analyzing the underlying properties of complex real-world networks. In this paper, we study a class of random graphs known as the inhomogeneous random K-out graphs which were recently…
We consider the network reliability problem in wireless sensor networks secured by the heterogeneous random key predistribution scheme. This scheme generalizes Eschenauer-Gligor scheme by considering the cases when the network comprises…
k-connectivity of random graphs is a fundamental property indicating reliability of multi-hop wireless sensor networks (WSN). WSNs comprising of sensor nodes with limited power resources are modeled by random graphs with unreliable nodes,…
The random key graph is a random graph naturally associated with the random key predistribution scheme of Eschenauer and Gligor for wireless sensor networks. For this class of random graphs we establish a new version of a conjectured…
Random intersection graphs have received much attention recently and been used in a wide range of applications ranging from key predistribution in wireless sensor networks to modeling social networks. For these graphs, each node is equipped…
We study the secure and reliable connectivity of wireless sensor networks under the heterogeneous pairwise key predistribution scheme. This scheme was recently introduced as an extension of the random pairwise key predistribution scheme of…
Random key graphs have received considerable attention and been used in various applications including secure sensor networks, social networks, the study of epidemics, cryptanalysis, and recommender systems. In this paper, we investigate a…
The Eschenauer--Gligor (EG) random key predistribution scheme has been widely recognized as a typical approach to secure communications in wireless sensor networks (WSNs). However, there is a lack of precise probability analysis on the…
We investigate the connectivity of a wireless sensor network secured by the heterogeneous key predistribution scheme under an independent on/off channel model. The heterogeneous scheme induces an inhomogeneous random key graph, denoted by…
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of…
We introduce a new random key predistribution scheme for securing heterogeneous wireless sensor networks. Each of the n sensors in the network is classified into r classes according to some probability distribution {\mu} = {{\mu}_1 , . . .…
Random K-out graphs are garnering interest in designing distributed systems including secure sensor networks, anonymous crypto-currency networks, and differentially-private decentralized learning. In these security-critical applications, it…
Random intersection graphs have received much attention for nearly two decades, and currently have a wide range of applications ranging from key predistribution in wireless sensor networks to modeling social networks. In this paper, we…
Random K-out graphs, denoted $\mathbb{H}(n;K)$, are generated by each of the $n$ nodes drawing $K$ out-edges towards $K$ distinct nodes selected uniformly at random, and then ignoring the orientation of the arcs. Recently, random K-out…