46 citations · 319 across the 26 of their papers we have counts for
5 papers · 1 filter
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…