Advertisement

Efficient Key Management in IoT Using Mobile Aggregator

  • Sumit Saurabh
  • Alwyn R. Pais
  • Sumanta ChatterjeeEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 625)

Abstract

Managing keys in Internet of Things (IoT) is challenging. With this proposed work we are trying to address an efficient key management protocol for specific application based scenario which enforces secure connectivity of devices and minimizes node capture attacks. There are a number of protocols that have been enforced and implemented for wireless sensor networks (WSN) and internet-enabled devices. We propose a protocol with mobility interface using combinatorial designs for key management in IoT devices. Mobile devices follow a dedicated path to collect data securely from installed devices in the network. We also compare our work with existing protocols and few mobility models.

Keywords

IoT Key predistribution WSN Combinatorial design 

References

  1. 1.
    Sundmaeker, H., Guillemin, P., Friess, P., Woelfflé, S.: Vision and challenges for realising the Internet of Things. In: EUR-OP, vol. 20, no. 10 (2010)Google Scholar
  2. 2.
    Du, W., Deng, J., Han, Y.S., Varshney, P.K., Katz, J., Khalili, A.: A pairwise key predistribution scheme for wireless sensor networks. ACM Trans. Inf. Syst. Secur. (TISSEC) 8(2), 228–258 (2005)CrossRefGoogle Scholar
  3. 3.
    Pattanayak, A., Majhi, B.: Key predistribution schemes in distributed wireless sensor network using combinatorial designs revisited. IACR Cryptol. ePrint Arch. 2009, 131 (2009)Google Scholar
  4. 4.
    Ruj, S., Nayak, A., Stojmenovic, I.: Pairwise and triple key distribution in wireless sensor networks with applications. IEEE Trans. Comput. 62(11), 2224–2237 (2013)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Mitchell, C.J., Piper, F.C.: Key storage in secure networks. Discrete Appl. Math. 21(3), 215–228 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Ruj, S., Roy, B.: Key predistribution using combinatorial designs for grid-group deployment scheme in wireless sensor networks. ACM Trans. Sens. Netw. (TOSN) 6(1), 4 (2009)Google Scholar
  7. 7.
    Çamtepe, S.A., Yener, B.: Combinatorial design of key distribution mechanisms for wireless sensor networks. IEEE/ACM Trans. Netw. 15(2), 346–358 (2007)CrossRefGoogle Scholar
  8. 8.
    Street, A.P., Street, D.J.: Combinatorics of Experimental Design. Oxford University Press Inc., Oxford (1986)zbMATHGoogle Scholar
  9. 9.
    Aschenbruck, N., Ernst, R., Gerhards-Padilla, E., Schwamborn, M.: BonnMotion: a mobility scenario generation and analysis tool. In: Proceedings of the 3rd International Conference on Simulation Tools and Techniques (ICST), p. 51 (2010)Google Scholar
  10. 10.
    Somasundara, A.A., Ramamoorthy, A., Srivastava, M.B.: Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines. In: Proceedings of the 25th IEEE International Real-Time Systems Symposium, pp. 296–305. IEEE (2004)Google Scholar
  11. 11.
    Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly-secure key distribution for dynamic conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2016

Authors and Affiliations

  • Sumit Saurabh
    • 1
  • Alwyn R. Pais
    • 1
  • Sumanta Chatterjee
    • 1
    Email author
  1. 1.National Institute of Technology KarnatakaMangaloreIndia

Personalised recommendations