A key-distribution mechanism for wireless sensor networks using Zig-Zag product

Secure communication in Wireless Sensor Networks (WSNs) necessitates utilisation of efficient key distribution mechanisms. Several works using probabilistic, deterministic, and hybrid methods have been conducted to address key distribution among nodes. In this paper, we propose a method to distribute key-chains utilising expander graphs based on the Zig-Zag product. Given a set of constraints such as network size, storage, and radio range, we are able to construct a resilient key distribution graph. The main advantage of the obtained method is attaining a shorter key-path length compared with previously proposed approaches. Simulation results demonstrate the efficiency of the proposed method.

[1]  Bülent Yener,et al.  Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks , 2004, ESORICS.

[2]  Mohsen Guizani,et al.  An Efficient Signal-Range-Based Probabilistic Key Predistribution Scheme in a Wireless Sensor Network , 2009, IEEE Transactions on Vehicular Technology.

[3]  Ahmad Khonsari,et al.  A Combinatorial Approach for Key-Distribution in Wireless Sensor Networks , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[4]  Douglas R. Stinson,et al.  Key predistribution for homogeneous wireless sensor networks with group deployment of nodes , 2010, TOSN.

[5]  Noga Alon,et al.  Semi-direct product in groups and zig-zag product in graphs: connections and applications , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[6]  David E. Culler,et al.  TOSSIM: accurate and scalable simulation of entire TinyOS applications , 2003, SenSys '03.

[7]  Zygmunt J. Haas,et al.  Securing ad hoc networks , 1999, IEEE Netw..

[8]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[9]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[10]  Hossam S. Hassanein,et al.  Connectivity Optimization for Wireless Sensor Networks Applied to Forest Monitoring , 2009, 2009 IEEE International Conference on Communications.

[11]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2005, Ad Hoc Networks.

[12]  Azzedine Boukerche,et al.  ARMA: a scalable secure routing protocol with privacy protection for mobile ad hoc networks , 2010, CMC 2010.

[13]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[14]  Moti Yung,et al.  Expander Graph based Key Distribution Mechanisms in Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Communications.

[15]  Amnon Ta-Shma,et al.  A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product , 2011, SIAM J. Comput..

[16]  Sushmita Ruj,et al.  Key predistribution using combinatorial designs for grid-group deployment scheme in wireless sensor networks , 2009, TOSN.

[17]  Panganamala Ramana Kumar,et al.  Scaling Laws for Ad Hoc Wireless Networks: An Information Theoretic Approach , 2006, Found. Trends Netw..

[18]  Frank Stajano,et al.  The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks , 1999, Security Protocols Workshop.

[19]  Xueping Li,et al.  Key establishment for layered group-based Wireless Sensor Networks , 2010, Int. J. Ad Hoc Ubiquitous Comput..

[20]  M. Murty.  Ramanujan Graphs , 1965 .

[21]  Nidal Nasser,et al.  Anonymous authentication and secure communication protocol for wireless mobile ad hoc networks , 2008, Secur. Commun. Networks.

[22]  Berk Sunar,et al.  Public Key Cryptography in Sensor Networks - Revisited , 2004, ESAS.

[23]  A. Wigderson,et al.  ENTROPY WAVES, THE ZIG-ZAG GRAPH PRODUCT, AND NEW CONSTANT-DEGREE , 2004, math/0406038.

[24]  Béla Bollobás,et al.  The Diameter of a Cycle Plus a Random Matching , 1988, SIAM J. Discret. Math..