Results on Vertex Degree and K-Connectivity in Uniform S-Intersection Graphs (CMU-CyLab-14-004)

Abstract : We present results related to the vertex degree in a uniform s-intersection graph which has received much interest recently. Specifically, we derive the probability distribution for the minimum vertex degree, and show that the number of vertices with an arbitrary degree converges to a Poisson distribution. A uniform s-intersection graph models the topology of a secure wireless sensor network employing the widely used s-composite key predistribution scheme. Our theoretical findings is also confirmed by numerical results.

[1]  Krzysztof Krzywdzinski,et al.  Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols , 2011, MFCS.

[2]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[3]  Virgil D. Gligor,et al.  k-Connectivity in Secure Wireless Sensor Networks with Physical Link Constraints - The On/Off Channel Model , 2012, ArXiv.

[4]  Mindaugas Bloznelis,et al.  Perfect matchings in random intersection graphs , 2013 .

[5]  Osman Yagan.  Performance of the Eschenauer–Gligor Key Distribution Scheme Under an ON/OFF Channel , 2012, IEEE Transactions on Information Theory.

[6]  Paul Erdös,et al.  On random graphs, I , 1959 .

[7]  Osman Yagan.  Random graph modeling of key distribution schemes in wireless sensor networks , 2011 .

[8]  Virgil D. Gligor,et al.  Secure k-connectivity in wireless sensor networks under an on/off channel model , 2013, 2013 IEEE International Symposium on Information Theory.

[9]  Mindaugas Bloznelis,et al.  Degree and clustering coefficient in sparse random intersection graphs , 2013, 1303.3388.

[10]  Mindaugas Bloznelis,et al.  Component evolution in a secure wireless sensor network , 2009 .

[11]  Jun Zhao,et al.  Topological Properties of Wireless Sensor Networks Under the Q-Composite Key Predistribution Scheme With Unreliable Links (CMU-CyLab-14-002) , 2014 .

[12]  Valentas Kurauskas,et al.  Assortativity and clustering of sparse random intersection graphs , 2012, 1209.4675.

[13]  Armand M. Makowski,et al.  Zero–One Laws for Connectivity in Random Key Graphs , 2009, IEEE Transactions on Information Theory.