A combinatorial approach for key-distribution in wireless sensor networks

H. Shafiei, A. Mehdizadeh, A. Khonsari, M. Ould-Khaoua

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
Pages138-142
Number of pages5
DOIs
Publication statusPublished - 2008
Event2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 - New Orleans, LA, United States
Duration: Nov 30 2008Dec 4 2008

Other

Other2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
CountryUnited States
CityNew Orleans, LA
Period11/30/0812/4/08

Fingerprint

Sensor nodes
Wireless sensor networks
Chain length
Secure communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Shafiei, H., Mehdizadeh, A., Khonsari, A., & Ould-Khaoua, M. (2008). A combinatorial approach for key-distribution in wireless sensor networks. In GLOBECOM - IEEE Global Telecommunications Conference (pp. 138-142). [4697809] https://doi.org/10.1109/GLOCOM.2008.ECP.34

A combinatorial approach for key-distribution in wireless sensor networks. / Shafiei, H.; Mehdizadeh, A.; Khonsari, A.; Ould-Khaoua, M.

GLOBECOM - IEEE Global Telecommunications Conference. 2008. p. 138-142 4697809.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shafiei, H, Mehdizadeh, A, Khonsari, A & Ould-Khaoua, M 2008, A combinatorial approach for key-distribution in wireless sensor networks. in GLOBECOM - IEEE Global Telecommunications Conference., 4697809, pp. 138-142, 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008, New Orleans, LA, United States, 11/30/08. https://doi.org/10.1109/GLOCOM.2008.ECP.34
Shafiei H, Mehdizadeh A, Khonsari A, Ould-Khaoua M. A combinatorial approach for key-distribution in wireless sensor networks. In GLOBECOM - IEEE Global Telecommunications Conference. 2008. p. 138-142. 4697809 https://doi.org/10.1109/GLOCOM.2008.ECP.34
Shafiei, H. ; Mehdizadeh, A. ; Khonsari, A. ; Ould-Khaoua, M. / A combinatorial approach for key-distribution in wireless sensor networks. GLOBECOM - IEEE Global Telecommunications Conference. 2008. pp. 138-142
@inproceedings{80ec59d9b6ed463aba772aadfb96da65,
title = "A combinatorial approach for key-distribution in wireless sensor networks",
abstract = "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.",
author = "H. Shafiei and A. Mehdizadeh and A. Khonsari and M. Ould-Khaoua",
year = "2008",
doi = "10.1109/GLOCOM.2008.ECP.34",
language = "English",
isbn = "9781424423248",
pages = "138--142",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

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

SN - 9781424423248

SP - 138

EP - 142

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -