Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bollobás, B., Erdős, P.: Cliques in Random Graphs. Mathematical Proceedings of the Cambridge Philosophical Society 80(3), 419–427 (1976)
Chan, H., Perrig, A., Song, D.: Random Key Predistribution Schemes for Sensor Networks. In: Proceedings of IEEE Security and Privacy Symposium, pp. 197–213 (May 2003)
Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory 22(6), 644–654 (1976)
Du, W., Deng, J., Han, Y., Varshney, P., Katz, J., Khalili, A.: A Pairwise Key predistribution Scheme for Wireless Sensor Networks. In: Proceedings of 10th ACM Conference on Computer and Communications Security, pp. 42–51 (October 2003)
Erdős, P., Rényi, A.: On Random Graphs. Publicationes Mathematicae 6, 290–297 (1959)
Eschenauer, L., Gligor, V.: A Key Management Scheme for Distributed Sensor Networks. In: Proceedings of the 9th ACM Conference on Computer and Communication Security, pp. 41–47 (November 2002)
Grimmett, G., McDiarmid, C.: On Coloring Random Graphs. Mathematical Proceedings of the Cambridge Philosophical Society 77, 313–324 (1975)
Gupta, R., Musacchio, J., Walrand, J.: Sufficient rate constraints for QoS flows in ad-hoc networks. Ad-hoc Network 5(4), 429–443 (2007)
Holland, P., Leinhardt, S.: Transitivity in Structural Models of Small Groups. Comparative Group Studies 2, 107–124 (1971)
Huang, D., Mehta, M., Medhi, D., Harn, L.: Location-aware key management scheme for wireless sensor networks. In: Proceedings of the 2nd ACM Workshop on Security of Ad-hoc and Sensor Networks, pp. 29–42 (October 2004)
Huang, X., Bensaou, B.: On Max-min Fairness and Scheduling in Wireless Ad Hoc Networks: Analytical Framework and Implementation. In: Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 221–231 (October 2001)
Huang, Y., Lee, W.: A Cooperative Intrusion Detection System for Ad Hoc Networks. In: Proceedings of the 1st ACM Workshop on Security of Ad Hoc and Sensor Networks, pp. 135–147 (2003)
Hwang, J., Kim, Y.: Revisiting random key predistribution schemes for wireless sensor networks. In: Proceedings of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks, pp. 43–52 (October 2004)
Liu, D., Ning, P.: Location-based pairwise key establishments for static sensor networks. In: Proceedings of the 1st ACM Workshop on Security of Ad-hoc and Sensor Networks, pp. 72–82 (October 2003)
Liu, D., Ning, P., Liu, R.: Establishing Pairwise Keys in Distributed Sensor Networks. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, pp. 52–61 (October 2003)
Massachusetts Institute of Technology, Kerberos: The Network Authentication Protocol, http://web.mit.edu/kerberos/
Pietro, R., Mancini, L., Mei, A., Panconesi, A., Radhakrishnan, J.: Redoubtable Sensor Networks. ACM Transactions on Information and System Security 11(3), 1–22 (2008)
Spencer, J.: The Strange Logic of Random Graphs. In: Algorithms and Combinatorics, vol. 22. Springer, Heidelberg (2000), ISBN 3-540-41654-4
Vu, T., Williamson, C., Safavi-Naini, R.: Simulation Modeling of Secure Wireless Sensor Networks. In: Proceedings of ValueTools 2009, Pisa, Italy (October 2009)
Watts, D., Strogatz, S.: Collective Dynamics of ‘Small-world’ Networks. Nature 393, 440–442 (1998)
Xue, Y., Li, B., Nahrstedt, K.: Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach. IEEE Transactions on Mobile Computing 5(4), 347–364 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vu, T.M., Safavi-Naini, R., Williamson, C. (2010). On Applicability of Random Graphs for Modeling Random Key Predistribution for Wireless Sensor Networks. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2010. Lecture Notes in Computer Science, vol 6366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16023-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-16023-3_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16022-6
Online ISBN: 978-3-642-16023-3
eBook Packages: Computer ScienceComputer Science (R0)