Abstract
Regular graph is the type of graph whose degree of all vertices are same, and this property makes it very useful in design of key distribution algorithm. Keys in wireless sensor node need to be evenly distributed for efficient storage and good connectivity. In the past various methods have been proposed to overcome the problem of key predistribution for wireless sensor network. Among these, the balanced incomplete block design technique from the theory of combinatorics provides a meaningful enhancement in key predistribution. Also various improvements have been done over this technique for especial arrangement of sensor network. Here, we use Paley graph a class of regular graph to model our key distribution in a location-independent sensor environment, where locations of sensor nodes are assumed to be unknown prior to deployment or key distribution. Experiments were performed and presented here.
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
References
Martin, K. M., & Paterson, M. (2008). An application-oriented framework for wireless sensor network key establishment. Electronic Notes in Theoretical Computer Science, 192(2), 31–41.
Xiao, Y., Rayi, V. K., Sun, B., Du, X., Hu, F., & Galloway, M. (2007). A survey of key management schemes in wireless sensor networks. Computer communications, 30(11), 2314–2341.
Lin, H. Y., Pan, D. J., Zhao, X. X., & Qiu, Z. R. (2008, April). A rapid and efficient pre-deployment key scheme for secure data transmissions in sensor networks using Lagrange interpolation polynomial. In Information Security and Assurance, 2008. ISA 2008. International Conference on (pp. 261–265). IEEE.
Blom, R. (1984, April). An optimal class of symmetric key generation systems. In Workshop on the Theory and Application of Cryptographic Techniques (pp. 335–338). Springer Berlin Heidelberg.
Camtepe, S. A., & Yener, B. (2007). Combinatorial design of key distribution mechanisms for wireless sensor networks. IEEE/ACM Transactions on networking, 15(2), 346–358.
Chakrabarti, D., Maitra, S., & Roy, B. (2005, December). A hybrid design of key pre-distribution scheme for wireless sensor networks. In International Conference on Information Systems Security (pp. 228–238). Springer Berlin Heidelberg.
Chan, H., Perrig, A., & Song, D. (2003, May). Random key predistribution schemes for sensor networks. In Security and Privacy, 2003. Proceedings. 2003 Symposium on (pp. 197–213). IEEE.
Kendall, M., & Martin, K. M. (2016). Graph-theoretic design and analysis of key predistribution schemes. Designs, Codes and Cryptography, 81(1), 11–34.
Saikia, M., & Hussain, M. A. (2016, August). Performance Analysis of Expander Graph Based Key Predistribution Scheme in WSN. In International Conference on Smart Trends for Information Technology and Computer Communications (pp. 724–732). Springer, Singapore.
Klonowski, M., & Syga, P. (2017). Enhancing Privacy for Ad Hoc Systems with Predeployment Key Distribution. Ad Hoc Networks.
Zhao, J. (2016). Analyzing Connectivity of Heterogeneous Secure Sensor Networks. IEEE Transactions on Control of Network Systems.
Bose, R. (1963). Strongly regular graphs, partial geometries and partially balanced designs. Pacific Journal of Mathematics, 13(2), 389–419.
Paley, R. E. (1933). On orthogonal matrices. Studies in Applied Mathematics, 12(1–4), 311–320.
Baker, R. D., Ebert, G. L., Hemmeter, J., & Woldar, A. (1996). Maximal cliques in the Paley graph of square order. Journal of statistical planning and inference, 56(1), 33–38.
Godsil, C., & Royle, G. (2001). Algebraic graph theory, volume 207 of Graduate Texts in Mathematics.
Sloane, N. J. (2007). The on-line encyclopedia of integer sequences. In Towards Mechanized Mathematical Assistants (pp. 130–130). Springer Berlin Heidelberg.
Acknowledgements
We acknowledge all faculty members from Department of ECE, NERIST who provided insight and expertise that greatly assisted the research and greatly improved the manuscript. We also acknowledge the suggestions in improving the manuscript from faculty members of Computer Science Department, NERIST.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Saikia, M., Hussain, M.A. (2018). Location-Independent Key Distribution for Sensor Network Using Regular Graph. In: Pattnaik, P., Rautaray, S., Das, H., Nayak, J. (eds) Progress in Computing, Analytics and Networking. Advances in Intelligent Systems and Computing, vol 710. Springer, Singapore. https://doi.org/10.1007/978-981-10-7871-2_1
Download citation
DOI: https://doi.org/10.1007/978-981-10-7871-2_1
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7870-5
Online ISBN: 978-981-10-7871-2
eBook Packages: EngineeringEngineering (R0)