On Applicability of Random Graphs for Modeling Random Key Predistribution for Wireless Sensor Networks

We study the applicability of random graph theory in modeling secure connectivity of wireless sensor networks. Specifically, our work focuses on the highly influential random key predistribution scheme by Eschenauer and Gligor to examine the appropriateness of the modeling in finding system parameters for desired connectivity. We use extensive simulation and theoretical results to identify ranges of the parameters where i) random graph theory is not applicable, ii) random graph theory may lead to estimates with excessive errors, and iii) random graph theory gives very accurate results. We also investigate the similarities and dissimilarities in the structure of random graphs and key graphs (i.e., graphs describing key sharing information between sensor nodes). Our results provide insights into research relying on random graph modeling to examine behaviors of key graphs.

[1]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[2]  B. Bollobás,et al.  Cliques in random graphs , 1976, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  Brahim Bensaou,et al.  On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation , 2001, MobiHoc '01.

[4]  P. Holland,et al.  TRANSITIVITY IN STRUCTURAL MODELS OF SMALL GROUPS , 1977 .

[5]  Deep Medhi,et al.  Location-aware key management scheme for wireless sensor networks , 2004, SASN '04.

[6]  Douglas R. Stinson,et al.  On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs , 2008, TSEC.

[7]  Yongdae Kim,et al.  Revisiting random key pre-distribution schemes for wireless sensor networks , 2004, SASN '04.

[8]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[9]  Wenke Lee,et al.  A cooperative intrusion detection system for ad hoc networks , 2003, SASN '03.

[10]  Roberto Di Pietro,et al.  Redoubtable Sensor Networks , 2008, TSEC.

[11]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[12]  Yunghsiang Sam Han,et al.  A pairwise key pre-distribution scheme for wireless sensor networks , 2003, CCS '03.

[13]  John Musacchio,et al.  Sufficient rate constraints for QoS flows in ad-hoc networks , 2007, Ad Hoc Networks.

[14]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[15]  Yunghsiang Sam Han,et al.  A pairwise key predistribution scheme for wireless sensor networks , 2005, TSEC.

[16]  Klara Nahrstedt,et al.  Optimal Resource Allocation , 2006 .

[17]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[18]  Donggang Liu,et al.  Location-based pairwise key establishments for static sensor networks , 2003, SASN '03.

[19]  Klara Nahrstedt,et al.  Optimal resource allocation in wireless ad hoc networks: a price-based approach , 2006, IEEE Transactions on Mobile Computing.

[20]  Donggang Liu,et al.  Establishing pairwise keys in distributed sensor networks , 2005, TSEC.

[21]  J. Spencer.  The Strange Logic of Random Graphs , 2001 .

[22]  Reihaneh Safavi-Naini,et al.  Simulation modeling of secure wireless sensor networks , 2009, VALUETOOLS.

[23]  G. Grimmett,et al.  On colouring random graphs , 1975 .

[24]  Riccardo Zecchina,et al.  Coloring random graphs , 2002, Physical review letters.