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
AN - SCOPUS:77951616693
SN - 9781424441488
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference
T2 - 2009 IEEE Global Telecommunications Conference, GLOBECOM 2009
Y2 - 30 November 2009 through 4 December 2009
ER -