Connectivity results for random key graphs

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 2403-2407

  Yǎgan, Osman ^a   Makowski, Armand M ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Connectivity; Key predistribution; Random key graphs; Wireless sensor networks; Zero one laws

Indexed keywords

CONNECTIVITY; GRAPH CONNECTIVITY; KEY PREDISTRIBUTION; KEY PREDISTRIBUTION SCHEME; RANDOM GRAPHS; RANDOM KEY GRAPHS; ZERO-ONE LAW; ZERO-ONE LAWS;

INFORMATION THEORY; SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 70449514558     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5206014     Document Type: Conference Paper

References (7)

1. S.R. Blackburn and S. Gerke, "Connectivity of the uniform random intersection graph," May 2008. arXiv:0805.2814v2 [math.CO]
2. B. Bollob́as, Random Graphs, Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge (UK), 200l.
3. R. Di Pietro, L.V. Mancini, A. Mei, A. Panconesi and J. Radhakrishnan, "Sensor networks that are provably secure," in Proceedings of SecureComm 2006, Baltimore (MD), August 2006.
4. R. Di Pietro, L.V. Mancini, A. Mei, A. Panconesi and J. Radhakrishnan, "Redoubtable sensor networks," ACM Transactions on Information Systems Security TISSEC 11 (2008), pp. 1-22.
5. L. Eschenauer and V.D. Gligor, "A key-management scheme for distributed sensor networks," in Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS 2002), Washington (DC), November 2002, pp. 41-47.
6. O. Yǎgan and A. M. Makowski, "On the random graph induced by a random key predistribution scheme under full visibility," in Proceedings of the IEEE International Symposium on Information Theory (ISIT 2008), Toronto (ON, Canada), June 2008.
7. O. Yǎgan and A.M. Makowski, "Zero-one laws for connectivity in random key graphs," Available online at http://hdl.handle.net/1903/8716, January 2009.