On the connectivity of key-distribution strategies in wireless sensor networks

H. Shafiei, Ahmad Khonsari, Mohammad S. Talebi, Mohamed Ould-Khaoua, Nazanin Dehghani

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

1 Citation (Scopus)

Abstract

Wireless sensor networks (WSNs) are usually missioned to gather critical information in hostile and adversarial environments, which make them susceptible to compromise and revelation. Therefore, establishing secure communication in such networks is of great importance necessitating utilization of efficient key distribution schemes. In order to address such methods, several works using probabilistic, deterministic and hybrid approaches have been introduced in past few years. In this paper, we study the connectivity of key-distribution mechanisms in secured topologies of wireless sensor networks. We explore the effect of the radio range on the connectivity of the network and provide a lower bound on the radio range under which the cover time of the underlying topology decreases significantly. We also deduce that any broadcasting algorithm in such a network is performing only by a factor O(nβ), where β ε (0, 1), worse than broadcasting algorithms in unsecured topologies. Our numerical results and simulation experiments validates the correctness and efficiency of our analysis.

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
DOIs
Publication statusPublished - 2009
Event2009 IEEE Global Telecommunications Conference, GLOBECOM 2009 - Honolulu, HI, United States
Duration: Nov 30 2009Dec 4 2009

Other

Other2009 IEEE Global Telecommunications Conference, GLOBECOM 2009
CountryUnited States
CityHonolulu, HI
Period11/30/0912/4/09

Fingerprint

Wireless sensor networks
Topology
Broadcasting
Experiments
Secure communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Shafiei, H., Khonsari, A., Talebi, M. S., Ould-Khaoua, M., & Dehghani, N. (2009). On the connectivity of key-distribution strategies in wireless sensor networks. In GLOBECOM - IEEE Global Telecommunications Conference [5425590] https://doi.org/10.1109/GLOCOM.2009.5425590

On the connectivity of key-distribution strategies in wireless sensor networks. / Shafiei, H.; Khonsari, Ahmad; Talebi, Mohammad S.; Ould-Khaoua, Mohamed; Dehghani, Nazanin.

GLOBECOM - IEEE Global Telecommunications Conference. 2009. 5425590.

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

Shafiei, H, Khonsari, A, Talebi, MS, Ould-Khaoua, M & Dehghani, N 2009, On the connectivity of key-distribution strategies in wireless sensor networks. in GLOBECOM - IEEE Global Telecommunications Conference., 5425590, 2009 IEEE Global Telecommunications Conference, GLOBECOM 2009, Honolulu, HI, United States, 11/30/09. https://doi.org/10.1109/GLOCOM.2009.5425590
Shafiei H, Khonsari A, Talebi MS, Ould-Khaoua M, Dehghani N. On the connectivity of key-distribution strategies in wireless sensor networks. In GLOBECOM - IEEE Global Telecommunications Conference. 2009. 5425590 https://doi.org/10.1109/GLOCOM.2009.5425590
Shafiei, H. ; Khonsari, Ahmad ; Talebi, Mohammad S. ; Ould-Khaoua, Mohamed ; Dehghani, Nazanin. / On the connectivity of key-distribution strategies in wireless sensor networks. GLOBECOM - IEEE Global Telecommunications Conference. 2009.
@inproceedings{97058668ee5c4120900d0706f6f9a606,
title = "On the connectivity of key-distribution strategies in wireless sensor networks",
abstract = "Wireless sensor networks (WSNs) are usually missioned to gather critical information in hostile and adversarial environments, which make them susceptible to compromise and revelation. Therefore, establishing secure communication in such networks is of great importance necessitating utilization of efficient key distribution schemes. In order to address such methods, several works using probabilistic, deterministic and hybrid approaches have been introduced in past few years. In this paper, we study the connectivity of key-distribution mechanisms in secured topologies of wireless sensor networks. We explore the effect of the radio range on the connectivity of the network and provide a lower bound on the radio range under which the cover time of the underlying topology decreases significantly. We also deduce that any broadcasting algorithm in such a network is performing only by a factor O(nβ), where β ε (0, 1), worse than broadcasting algorithms in unsecured topologies. Our numerical results and simulation experiments validates the correctness and efficiency of our analysis.",
author = "H. Shafiei and Ahmad Khonsari and Talebi, {Mohammad S.} and Mohamed Ould-Khaoua and Nazanin Dehghani",
year = "2009",
doi = "10.1109/GLOCOM.2009.5425590",
language = "English",
isbn = "9781424441488",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - On the connectivity of key-distribution strategies in wireless sensor networks

AU - Shafiei, H.

AU - Khonsari, Ahmad

AU - Talebi, Mohammad S.

AU - Ould-Khaoua, Mohamed

AU - Dehghani, Nazanin

PY - 2009

Y1 - 2009

N2 - Wireless sensor networks (WSNs) are usually missioned to gather critical information in hostile and adversarial environments, which make them susceptible to compromise and revelation. Therefore, establishing secure communication in such networks is of great importance necessitating utilization of efficient key distribution schemes. In order to address such methods, several works using probabilistic, deterministic and hybrid approaches have been introduced in past few years. In this paper, we study the connectivity of key-distribution mechanisms in secured topologies of wireless sensor networks. We explore the effect of the radio range on the connectivity of the network and provide a lower bound on the radio range under which the cover time of the underlying topology decreases significantly. We also deduce that any broadcasting algorithm in such a network is performing only by a factor O(nβ), where β ε (0, 1), worse than broadcasting algorithms in unsecured topologies. Our numerical results and simulation experiments validates the correctness and efficiency of our analysis.

AB - Wireless sensor networks (WSNs) are usually missioned to gather critical information in hostile and adversarial environments, which make them susceptible to compromise and revelation. Therefore, establishing secure communication in such networks is of great importance necessitating utilization of efficient key distribution schemes. In order to address such methods, several works using probabilistic, deterministic and hybrid approaches have been introduced in past few years. In this paper, we study the connectivity of key-distribution mechanisms in secured topologies of wireless sensor networks. We explore the effect of the radio range on the connectivity of the network and provide a lower bound on the radio range under which the cover time of the underlying topology decreases significantly. We also deduce that any broadcasting algorithm in such a network is performing only by a factor O(nβ), where β ε (0, 1), worse than broadcasting algorithms in unsecured topologies. Our numerical results and simulation experiments validates the correctness and efficiency of our analysis.

UR - http://www.scopus.com/inward/record.url?scp=77951616693&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951616693&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2009.5425590

DO - 10.1109/GLOCOM.2009.5425590

M3 - Conference contribution

SN - 9781424441488

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -