Connectivity in inhomogeneous random key graphs
暂无分享,去创建一个
[1] Yeh-Ching Chung,et al. Heterogeneous Wireless Sensor Network Deployment and Topology Control Based on Irregular Sensor Model , 2007, GPC.
[2] Osman Yagan. Performance of the Eschenauer–Gligor Key Distribution Scheme Under an ON/OFF Channel , 2012, IEEE Transactions on Information Theory.
[3] Armand M. Makowski,et al. Connectivity in random graphs induced by a key predistribution scheme - small key pools , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).
[4] Mindaugas Bloznelis,et al. Component evolution in a secure wireless sensor network , 2009 .
[5] Peter Marbach. A lower-bound on the number of rankings required in recommender systems using collaborativ filtering , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.
[6] Dawn Xiaodong Song,et al. Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..
[7] Armand M. Makowski,et al. Zero–One Laws for Connectivity in Random Key Graphs , 2009, IEEE Transactions on Information Theory.
[8] Armand M. Makowski,et al. Random Key Graphs Can They be Small Worlds? , 2009, 2009 First International Conference on Networks & Communications.
[9] Katarzyna Rybarczyk,et al. Diameter, connectivity, and phase transition of the uniform random intersection graph , 2011, Discret. Math..
[10] Osman Yagan. Absence of isolated nodes in inhomogeneous random key graphs , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[11] Erhard Godehardt,et al. Two Models of Random Intersection Graphs for Classification , 2003 .
[12] Armand M. Makowski,et al. Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links , 2013, IEEE Transactions on Information Theory.
[13] Luc Devroye,et al. Connectivity of inhomogeneous random graphs , 2012, Random Struct. Algorithms.
[14] Jun Zhao,et al. $k$ -Connectivity in Random Key Graphs With Unreliable Links , 2015, IEEE Transactions on Information Theory.
[15] 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.
[16] Virgil D. Gligor,et al. A key-management scheme for distributed sensor networks , 2002, CCS '02.
[17] 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).
[18] Mathew D. Penrose,et al. Random Geometric Graphs , 2003 .
[19] Tetsunao Matsuta,et al. 国際会議開催報告:2013 IEEE International Symposium on Information Theory , 2013 .
[20] Osman Yagan. Zero-One Laws for Connectivity in Inhomogeneous Random Key Graphs , 2016, IEEE Transactions on Information Theory.
[21] B. Bollobás,et al. The phase transition in inhomogeneous random graphs , 2007 .
[22] Yunghsiang Sam Han,et al. A key management scheme for wireless sensor networks using deployment knowledge , 2004, IEEE INFOCOM 2004.
[23] Erhard Godehardt,et al. Random Intersection Graphs and Classification , 2006, GfKl.
[24] Suresh Singh,et al. Exploiting heterogeneity in sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[25] Armand M. Makowski,et al. Designing Securely Connected Wireless Sensor Networks in the Presence of Unreliable Links , 2011, 2011 IEEE International Conference on Communications (ICC).
[26] Béla Bollobás,et al. Random Graphs: Notation , 2001 .
[27] Roberto Di Pietro,et al. Redoubtable Sensor Networks , 2008, TSEC.