On the random graph induced by a random key predistribution scheme under full visibility

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 544-548

  Yaǧan, Osman ^a   Makowski, Armand M ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Absence of isolated nodes; Key predistribution; Poisson convergence; Secure connectivity; Wireless sensor networks; Zero one laws

Indexed keywords

ABSENCE OF ISOLATED NODES; GRAPH CONNECTIVITY; INTERNATIONAL SYMPOSIUM; ISOLATED NODES; KEY PREDISTRIBUTION; KEY PREDISTRIBUTION SCHEMES; POISSON CONVERGENCE; RANDOM GRAPHS; SECURE CONNECTIVITY; WIRELESS SENSOR NETWORKS; ZERO-ONE LAW; ZERO-ONE LAWS;

CELLULAR RADIO SYSTEMS; CONVERGENCE OF NUMERICAL METHODS; CYBERNETICS; INFORMATION THEORY; KETONES; OPTICAL PROPERTIES; RANDOM PROCESSES; TECHNICAL PRESENTATIONS; TELECOMMUNICATION NETWORKS; VISIBILITY;

GRAPH THEORY;

EID: 52349121774     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595045     Document Type: Conference Paper

References (16)

1. A. D. Barbour, L. Hoist and S. Janson, Poisson Approximation, Oxford Studies in Probability 2, Oxford University Press, Oxford (UK), 1992.
2. B. Bollobás, Random Graphs, Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge (UK), 2001.
3. H. Chen, A. Perrig and D. Song, "Random key predistribution schemes for sensor networks," in Proceedings of the 2003 IEEE Symposium on Security and Privacy (S&P 2003), Oakland (CA), May 2003, pp. 197-213.
4. R. Di Pietro, L.V. Mancini, A. Mei, A. Panconesi and J. Radhakrishnan, "Sensor networks that are provably secure," in Proceedings of Secure Comm 2006, the 2nd IEEE/CreateNet International Conference on Security and Privacy in Communication Networks, Baltimore (MD), August 2006.
5. W. Du, J. Deng, Y.S. Han and P.K. Varshney, "A pairwise key predistribution scheme for wireless sensor networks," in Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS 2003), Washington (DC), October 2003, pp. 42-51.
6. P. Erdös and A. Rényi, "On the evolution of random graphs," Publ. Math. Inst. Hung. Acad. Sci. 5 (1960), pp. 17-61.
7. 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.
8. J. Fill, E.R. Schneinerman and K.B. Cohen-Singer, "Random intersection graphs when m = ω(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models, Random Structures and Algorithms 16 (2000), pp. 249-258.
9. J. Hwang and Y. Kim, "Revisiting random key pre-distribution schemes for wireless sensor networks," in the Proceedings of the Second ACM Workshop on Security of Ad Hoc And Sensor Networks (SASN 2004), Washington (DC), October 2004.
10. S. Janson, T. Łuczak and A. Ruciński, Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, 2000.
11. M.K. Karoński, E.R. Schneinerman, and K.B. Singer-Cohen, "On random intersection graphs: The subgraph problem," Combinatorics, Probability and Computing 8 (1999), pp. 131-159.
12. M.D. Penrose, Random Geometric Graphs, Oxford Studies in Probability 5, Oxford University Press, New York (NY), 2003.
13. A. Perrig, J. Stankovic and D. Wagner, "Security in wireless sensor networks," Communications of the ACM 47 (2004), pp. 53-57.
14. K.B. Singer, Random Intersection Graphs, Ph.D. Thesis, Department of Mathematical Sciences, The Johns Hopkins University, Baltimore (MD), 1995.
15. D.-M. Sun and B. He, "Review of key management mechanisms in wireless sensor networks," Acta Automatica Sinica 12(2006), pp. 900-906.
16. O. Yaǧan and A.M. Makowski, "On the random graph induced by a random key predistribution scheme under full visibility (Extended version)," Available online at http://hdl.handle.net/1903/7498, January 2008.