TY - GEN
T1 - A combinatorial approach for key-distribution in wireless sensor networks
AU - Shafiei, H.
AU - Mehdizadeh, A.
AU - Khonsari, A.
AU - Ould-Khaoua, M.
PY - 2008
Y1 - 2008
N2 - Sensor nodes are usually deployed in adversarial environments in which they are subject to compromise and revelation of critical information rendering the entire network useless. Therefore, secure communication of wireless sensor networks (WSNs) necessitates utilization of efficient key distribution schemes. Over the past few years, several works using probabilistic, deterministic and hybrid methods have been conducted to address key distribution among sensor nodes. In this paper we propose a novel method to deterministically distribute key-chains throughout a WSN utilizing expander graphs based on the ZigZag graph product. Given a set of constraints such as network size, amount of storage, radio range and key-chain length, we are able to efficiently construct a resilient yet scalable key distribution graph. The main advantage of the obtained method is providing a more user-adjustable and predictable framework compared to the previously proposed approaches. Simulation results demonstrate the efficiency of our proposed scheme and its general applicability to different network paradigms with diverse requirements.
AB - Sensor nodes are usually deployed in adversarial environments in which they are subject to compromise and revelation of critical information rendering the entire network useless. Therefore, secure communication of wireless sensor networks (WSNs) necessitates utilization of efficient key distribution schemes. Over the past few years, several works using probabilistic, deterministic and hybrid methods have been conducted to address key distribution among sensor nodes. In this paper we propose a novel method to deterministically distribute key-chains throughout a WSN utilizing expander graphs based on the ZigZag graph product. Given a set of constraints such as network size, amount of storage, radio range and key-chain length, we are able to efficiently construct a resilient yet scalable key distribution graph. The main advantage of the obtained method is providing a more user-adjustable and predictable framework compared to the previously proposed approaches. Simulation results demonstrate the efficiency of our proposed scheme and its general applicability to different network paradigms with diverse requirements.
UR - http://www.scopus.com/inward/record.url?scp=67449085420&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67449085420&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2008.ECP.34
DO - 10.1109/GLOCOM.2008.ECP.34
M3 - Conference contribution
AN - SCOPUS:67449085420
SN - 9781424423248
T3 - GLOBECOM - IEEE Global Telecommunications Conference
SP - 138
EP - 142
BT - 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
T2 - 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
Y2 - 30 November 2008 through 4 December 2008
ER -