Component evolution a secure wireless sensor network

Networks

Volumn 53, Issue 1, 2009, Pages 19-26

  Bloznelis, M ^a   Jaworski, J ^b   Rybarczyk, K ^b  

^a VILNIUS UNIVERSITY   (Lithuania)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

Connectivity; Phase transition; Random graph; Random intersection graph; Wireless sensor network

Indexed keywords

GRAPH THEORY; INTERSECTIONS; KEYS (FOR LOCKS); PHASE TRANSITIONS; PUBLIC KEY CRYPTOGRAPHY; SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

COMMUNICATION LINKS; COMPONENT EVOLUTIONS; CONNECTED COMPONENTS; CONNECTIVITY; CONNECTIVITY PROPERTIES; HIGH PROBABILITIES; LARGE N; RANDOM GRAPH; RANDOM INTERSECTION GRAPH; SECURE WIRELESS NETWORKS; SECURE WIRELESS SENSOR NETWORKS;

WIRELESS SENSOR NETWORKS;

EID: 61349175162     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20256     Document Type: Article

References (13)

1. M. Behrisch, Component evolution in random intersection graphs, Electron J Combinat 14 (2007), R17.
2. H. Chan, A. Perrig, and D. Song, Random key predistribution schemes for sensor networks, Proc 2003 IEEE Symp Res Security Privacy, Oakland, CA, 2003, pp. 197-213.
3. R. Di Pietro, L. V. Mancini, A. Mei, A. Panconesi, and J. Radhakrishnan, Sensornetworks that are provably resilient, Proc 2nd IEEE Int Conf Security Privacy Emerging Areas Commun Networks (SecureComm 2006), Baltimore, MD, 2006.
4. P. Erdos and A. Rényi, On the evolution of random graphs, Publ Math Inst Hungar Acad Sci 5 (1960), 17-61.
5. L. Eschenauer and V.D. Gligor, A key-management scheme for distributed sensor networks, Proc 9th ACM Conf Comput Commun Security, Washington, DC, 2002, pp. 41-47.
6. J.A.Fill, E.R. Scheinerman, and K.B. Singer-Cohen, Random intersection graphs when #im = ω{n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models, Random Struct Algorithms 16 (2000), 156-176.
7. E. Godehardt and J. Jaworski, Two models of random intersection graphs for classification. Exploratory data analysis in empirical research, M. Schwaiger, O. Opitz (Editors), Springer, Berlin-Heidelberg, 2003, pp. 67-81.
8. E. Godehardt, J. Jaworski, and K. Rybarczyk, Random intersection graphs and classification. Advances in data analysis, R. Decker, H. J. Lenz (Editors), Springer, Berlin-Heidelberg, 2007, pp. 67-74.
9. J. Hwang and Y. Kim, Revisiting random key pre-distribution schemes for wireless sensor networks, Proc 2nd ACM Workshop Security Ad Hoc Sensor Networks, Washington, DC, 2004, pp. 43-52.
10. S. Janson, T. łuczak, and A. Ruciński, Random graphs, Wiley, New York, 2000.
11. J. Jaworski and I. Smit, On a random digraph, Ann Discrete Math 33 (1987), 111-127.
12. M. Karoński, E.R. Scheinerman, and K.B. Singer-Cohen, On random intersection graphs: The subgraph problem, Combinat Probabil Comput 8 (1999), 131-159.
13. K.B. Singer-Cohen, Random intersection graphs, Department of Mathematical Sciences, The Johns Hopkins University, Baltimore, MD, 1995.