Using Residual Design for Key Management in Hierarchical Wireless Sensor Networks
محورهای موضوعی : Wireless Network
Vahid Modiri
1
(Science and research Islamic Azad University)
Hamid Haj Seyyed Javadi
2
(Shahed University)
Amir Masoud Rahmani
3
(Science and Research Branch, Islamic Azad University)
Mohaddese Anzani
4
(Shahed University)
کلید واژه: Wireless sensor networks, , Key pre-distribution, , Residual Design, , Hierarchical network model, ,
چکیده مقاله :
Combinatorial designs are powerful structures for key management in wireless sensor networks to address good connectivity and also security against external attacks in large scale networks. Many researchers have used key pre-distribution schemes using combinatorial structures in which key-rings, are pre-distributed to each sensor node before deployment in a real environment. Regarding the restricted resources, key distribution is a great engagement and challenging issue in providing sufficient security in wireless sensor networks. To provide secure communication, a unique key should be found from their stored key-rings. Most of the key pre-distribution protocols based on public-key mechanisms could not support highly scalable networks due to their key storage overhead and communication cost that linearly increasing. In this paper, we introduce a new key distribution approach for hierarchical clustered wireless sensor networks. Each cluster has a construction that contains new points or that reinforces and builds upon similar ideas of their head clusters. Based on Residual Design as a powerful algebraic combinatorial architecture and hierarchical network model, our approach guarantees good connectivity between sensor nodes and also cluster heads. Compared with similar existing schemes, our approach can provide sufficient security no matter if the cluster head or normal sensor node is compromised
Combinatorial designs are powerful structures for key management in wireless sensor networks to address good connectivity and also security against external attacks in large scale networks. Many researchers have used key pre-distribution schemes using combinatorial structures in which key-rings, are pre-distributed to each sensor node before deployment in a real environment. Regarding the restricted resources, key distribution is a great engagement and challenging issue in providing sufficient security in wireless sensor networks. To provide secure communication, a unique key should be found from their stored key-rings. Most of the key pre-distribution protocols based on public-key mechanisms could not support highly scalable networks due to their key storage overhead and communication cost that linearly increasing. In this paper, we introduce a new key distribution approach for hierarchical clustered wireless sensor networks. Each cluster has a construction that contains new points or that reinforces and builds upon similar ideas of their head clusters. Based on Residual Design as a powerful algebraic combinatorial architecture and hierarchical network model, our approach guarantees good connectivity between sensor nodes and also cluster heads. Compared with similar existing schemes, our approach can provide sufficient security no matter if the cluster head or normal sensor node is compromised
[1] C. Boyd, A. Mathuria, and D. Stebila, Protocols for authentication and key establishment. Springer, 2003.
[2] I. Memon, "A secure and efficient communication scheme with authenticated key establishment protocol for road networks," Wireless Personal Communications, vol. 85, no. 3, pp. 1167-1191, 2015.
[3] I. Memon, I. Hussain, R. Akhtar, and G. Chen, "Enhanced privacy and authentication: An efficient and secure anonymous communication for location based service using asymmetric cryptography scheme," Wireless Personal Communications, vol. 84, no. 2, pp. 1487-1508, 2015.
[4] J. Zhang and V. Varadharajan, "Wireless sensor network key management survey and taxonomy," Journal of network and computer applications, vol. 33, no. 2, pp. 63-75, 2010.
[5] J.-W. Dong, D.-Y. Pei, and X.-L. Wang, "A class of key predistribution schemes based on orthogonal arrays," Journal of Computer Science and Technology, vol. 23, no. 5, pp. 825-831, 2008.
[6] L. Eschenauer and V. D. Gligor, "A key-management scheme for distributed sensor networks," in Proceedings of the 9th ACM conference on Computer and communications security, 2002, pp. 41-47.
[7] H. Chan, A. Perrig, and D. Song, "Random key predistribution schemes for sensor networks," in 2003 Symposium on Security and Privacy, 2003, 2003: IEEE, pp. 197-213.
[8] S. A. Çamtepe and B. Yener, "Combinatorial design of key distribution mechanisms for wireless sensor networks," IEEE/ACM Transactions on networking, vol. 15, no. 2, pp. 346-358, 2007.
[9] J. Lee and D. R. Stinson, "On the construction of practical key predistribution schemes for distributed sensor networks using combinatorial designs," ACM Transactions on Information and System Security (TISSEC), vol. 11, no. 2, pp. 1-35, 2008.
[10] X. Zhang and J. Wang, "An efficient key management scheme in hierarchical wireless sensor networks," in 2015 International Conference on Computing, Communication and Security (ICCCS), 2015: IEEE, pp. 1-7.
[11] V. Modiri, H. H. S. Javadi, and M. Anzani, "A novel scalable key pre-distribution scheme for wireless sensor networks based on residual design," Wireless Personal Communications, vol. 96, no. 2, pp. 2821-2841, 2017.
[12] M. Anzani, H. H. S. Javadi, and V. Modirir, "Key-management scheme for wireless sensor networks based on merging blocks of symmetric design," Wireless Networks, vol. 24, no. 8, pp. 2867-2879, 2018.
[13] S. Ruj and B. Roy, "Key pre-distribution using partially balanced designs in wireless sensor networks," International Journal of High Performance Computing and Networking, vol. 7, no. 1, pp. 19-28, 2011.
[14] M. Javanbakht, H. Erfani, H. H. S. Javadi, and P. Daneshjoo, "Key predistribution scheme for clustered hierarchical wireless sensor networks based on combinatorial designs," Security and Communication Networks, vol. 7, no. 11, pp. 2003-2014, 2014.
[15] Y. Cheng and D. P. Agrawal, "An improved key distribution mechanism for large-scale hierarchical wireless sensor networks," Ad Hoc Networks, vol. 5, no. 1, pp. 35-48, 2007.
[16] Y. Zhang and P. Li, "Key management scheme based on nodes capture probability for wireless sensor networks," in 2018 Chinese Control and Decision Conference (CCDC), 2018: IEEE, pp. 5470-5475.
[17] A. Albakri, L. Harn, and S. Song, "Hierarchical key management scheme with probabilistic security in a wireless sensor network (WSN)," Security and Communication Networks, vol. 2019, 2019.
[18] D. Stinson, Combinatorial designs: constructions and analysis. Springer Science & Business Media, 2007.
[19] T. Kavitha and R. Kaliyaperumal, "Energy Efficient Hierarchical Key Management Protocol," in 2019 5th International Conference on Advanced Computing & Communication Systems (ICACCS), 2019: IEEE, pp. 53-60.
[20] S. Zhao, K. Tepe, I. Seskar, and D. Raychaudhuri, "Routing protocols for self-organizing hierarchical ad-hoc wireless networks," 2003.
[21] B. Liu, Z. Liu, and D. Towsley, "On the capacity of hybrid wireless networks," in IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No. 03CH37428), 2003, vol. 2: IEEE, pp. 1543-1552.
[22] G. Gupta and M. Younis, "Performance evaluation of load-balanced clustering of wireless sensor networks," in 10th International Conference on Telecommunications, 2003. ICT 2003, 2003, vol. 2: IEEE, pp. 1577-1583.
[23] J. Li and R. Levy, "Fair and Secure Clustering Scheme (FSCS) clustering protocol," In Technical report, 2005.
[24] O. Younis and S. Fahmy, "HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks," IEEE Transactions on mobile computing, vol. 3, no. 4, pp. 366-379, 2004.
