178 citations · 388 across the 14 of their papers we have counts for
14 papers
On Connectivity and Robustness in Random Intersection Graphs
Jun Zhao, Osman Yagan, Virgil Gligor
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 model…
Connectivity in Secure Wireless Sensor Networks under Transmission Constraints
Jun Zhao, Osman Yağan, Virgil Gligor
In wireless sensor networks (WSNs), the Eschenauer-Gligor (EG) key pre-distribution scheme is a widely recognized way to secure communications. Although connectivity properties of…
Random intersection graphs and their applications in security, wireless communication, and social networks
Jun Zhao, Osman Yağan, Virgil Gligor
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 predist…
A curious gap in one-dimensional geometric random graphs between connectivity and the absence of isolated node
Jun Zhao, Osman Yağan, Virgil Gligor
One-dimensional geometric random graphs are constructed by distributing nodes uniformly and independently on a unit interval and then assigning an undirected edge between any t…
Monotone Increasing Properties and Their Phase Transitions in Uniform Random Intersection Graphs
Jun Zhao, Osman Yağan, Virgil Gligor
Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with nodes is constructed as follows:…
k-Connectivity of Random Key Graphs
Jun Zhao, Osman Yağan, Virgil Gligor
Random key graphs represent topologies of secure wireless sensor networks that apply the seminal Eschenauer-Gligor random key predistribution scheme to secure communication between…
Designing Securely and Reliably Connected Wireless Sensor Networks
Jun Zhao, Osman Yağan, Virgil Gligor
In wireless sensor networks, the -composite key predistribution scheme is a widely recognized way to secure communications. Although connectivity properties of secure sensor net…
On the strengths of connectivity and robustness in general random intersection graphs
Jun Zhao, Osman Yağan, Virgil Gligor
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…
Exact Analysis of k-Connectivity in Secure Sensor Networks with Unreliable Links
Jun Zhao, Osman Yağan, Virgil Gligor
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,…
On -connectivity and minimum vertex degree in random -intersection graphs
Jun Zhao, Osman Yağan, Virgil Gligor
Random -intersection graphs have recently received much interest in a wide range of application areas. Broadly speaking, a random -intersection graph is constructed by first…
On Topological Properties of Wireless Sensor Networks under the q-Composite Key Predistribution Scheme with On/Off Channels
Jun Zhao, Osman Yağan, Virgil Gligor
The q-composite key predistribution scheme [1] is used prevalently for secure communications in large-scale wireless sensor networks (WSNs). Prior work [2]-[4] explores topological…
Towards -connectivity of the random graph induced by a pairwise key predistribution scheme with unreliable links
Faruk Yavuz, Jun Zhao, Osman Yağan +1
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…
k-Connectivity in Random Key Graphs with Unreliable Links
Jun Zhao, Osman Yagan, Virgil Gligor
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 senso…
Analysis of complex contagions in random multiplex networks
Osman Yagan, Virgil Gligor
We study the diffusion of influence in random multiplex networks where links can be of different types, and for a given content (e.g., rumor, product, political view), each lin…