Location-Independent Key Distribution for Sensor Network Using Regular Graph

  • Monjul Saikia
  • Md. Anwar Hussain
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 710)


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.


Location-independent KPS Wireless sensor network Graph Strongly regular graph 



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.


  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    Kendall, M., & Martin, K. M. (2016). Graph-theoretic design and analysis of key predistribution schemes. Designs, Codes and Cryptography, 81(1), 11–34.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    Klonowski, M., & Syga, P. (2017). Enhancing Privacy for Ad Hoc Systems with Predeployment Key Distribution. Ad Hoc Networks.Google Scholar
  11. 11.
    Zhao, J. (2016). Analyzing Connectivity of Heterogeneous Secure Sensor Networks. IEEE Transactions on Control of Network Systems.Google Scholar
  12. 12.
    Bose, R. (1963). Strongly regular graphs, partial geometries and partially balanced designs. Pacific Journal of Mathematics, 13(2), 389–419.Google Scholar
  13. 13.
    Paley, R. E. (1933). On orthogonal matrices. Studies in Applied Mathematics, 12(1–4), 311–320.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    Godsil, C., & Royle, G. (2001). Algebraic graph theory, volume 207 of Graduate Texts in Mathematics.Google Scholar
  16. 16.
    Sloane, N. J. (2007). The on-line encyclopedia of integer sequences. In Towards Mechanized Mathematical Assistants (pp. 130–130). Springer Berlin Heidelberg.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.Department of CSENorth Eastern Regional Institute of Science and TechnologyNurjuliIndia
  2. 2.Department of ECENorth Eastern Regional Institute of Science and TechnologyNurjuliIndia

Personalised recommendations