暂无分享,去创建一个
[1] Katarzyna Rybarczyk,et al. Sharp threshold functions for the random intersection graph via coupling method , 2009, 0910.0749.
[2] Virgil D. Gligor,et al. k-Connectivity in Secure Wireless Sensor Networks with Physical Link Constraints - The On/Off Channel Model , 2012, ArXiv.
[3] Krzysztof Krzywdzinski,et al. Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols , 2011, MFCS.
[4] M. Penrose. On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.
[5] Katarzyna Rybarczyk. The Coupling Method for Inhomogeneous Random Intersection Graphs , 2017, Electron. J. Comb..
[6] Jun Zhao,et al. Connectivity in secure wireless sensor networks under transmission constraints , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[7] Valentas Kurauskas,et al. Assortativity and clustering of sparse random intersection graphs , 2012, 1209.4675.
[8] Bernhard Klar,et al. BOUNDS ON TAIL PROBABILITIES OF DISCRETE DISTRIBUTIONS , 2000, Probability in the Engineering and Informational Sciences.
[9] Virgil D. Gligor,et al. On topological properties of wireless sensor networks under the q-composite key predistribution scheme with on/off channels , 2014, 2014 IEEE International Symposium on Information Theory.
[10] Mindaugas Bloznelis,et al. Perfect matchings in random intersection graphs , 2013 .
[11] Mindaugas Bloznelis,et al. Component evolution in a secure wireless sensor network , 2009 .
[12] Mindaugas Bloznelis,et al. Degree and clustering coefficient in sparse random intersection graphs , 2013, 1303.3388.
[13] Mathew D. Penrose,et al. Random Geometric Graphs , 2003 .
[14] Mindaugas Bloznelis,et al. Component evolution in a secure wireless sensor network , 2009, Networks.
[15] Virgil D. Gligor,et al. A key-management scheme for distributed sensor networks , 2002, CCS '02.
[16] Mathew D. Penrose,et al. On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.
[17] Paolo Santi,et al. The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..
[18] Xiang-Yang Li,et al. Fault tolerant deployment and topology control in wireless networks , 2003, MobiHoc '03.
[19] Dawn Xiaodong Song,et al. Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..
[20] Tracy Camp,et al. A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..
[21] James Allen Fill,et al. Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models , 2000, Random Struct. Algorithms.
[22] Piyush Gupta,et al. Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .
[23] Faramarz Fekri,et al. A Resiliency-Connectivity metric in wireless sensor networks with key predistribution schemes and node compromise attacks , 2008, Phys. Commun..
[24] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[25] 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 .
[26] I. Olkin,et al. Probability in the Engineering and Informational Sciences , 2013 .
[27] Jun Zhao,et al. Topological Properties of Secure Wireless Sensor Networks Under the $q$ -Composite Key Predistribution Scheme With Unreliable Links , 2017, IEEE/ACM Transactions on Networking.
[28] D. Manjunath,et al. On connectivity thresholds in superposition of random key graphs on random geometric graphs , 2013, 2013 IEEE International Symposium on Information Theory.
[29] James Allen Fill,et al. Random intersection graphs when m= w (n): an equivalence theorem relating the evolution of the G ( n, m, p ) and G ( n,P /italic>) models , 2000 .
[30] Stefanie Gerke,et al. Connectivity of the uniform random intersection graph , 2008, Discret. Math..
[31] Roberto Di Pietro,et al. Connectivity properties of secure wireless sensor networks , 2004, SASN '04.
[32] Virgil D. Gligor,et al. On the strengths of connectivity and robustness in general random intersection graphs , 2014, 53rd IEEE Conference on Decision and Control.
[33] M. Penrose. CONNECTIVITY OF SOFT RANDOM GEOMETRIC GRAPHS , 2013, 1311.3897.
[34] Osman Yagan. Random graph modeling of key distribution schemes in wireless sensor networks , 2011 .
[35] Peng-Jun Wan,et al. Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks , 2004, MobiHoc '04.