46 citations · 319 across the 26 of their papers we have counts for
Showing 2014 · cs.DMShow all
2 papers · 2 filters
cs.DM2014★ 29 cited
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…
cs.DM2014★ 26 cited
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…