Paper Info
Title
Expander Graph Based Key Distribution Mechanisms In Wireless Sensor Networks
Abstract
Secure communications between large number of sensor nodes that are randomly scattered over a hostile territory, necessitate efficient key distribution schemes. However, due to limited resources at sensor nodes such schemes cannot be based on post deployment computations. Instead, pairwise (symmetric) keys are required to be pre-distributed by assigning a list of keys, (a.k.a. key-chain), to each sensor node. If a pair of nodes does not have a common key after deployment then they must find a key-path with secured links. The objective is to minimize the key-chain size while (i) maximizing pairwise key sharing probability and resilience, and (ii) minimizing average key-path length.This paper presents a deterministic key distribution scheme based on Expander Graphs. It shows how to map the parameters (e.g., degree, expansion, and diameter) of a Ramanujan Expander Graph to the desired properties of a key distribution scheme for a physical network topology.
Year
DOI
Venue
2006
10.1109/ICC.2006.255107
2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12
Keywords
Field
DocType
expander graph,network topology,intrusion detection,raman scattering,wireless sensor networks,secure communication,resilience,computer science,graph theory,key distribution,wireless sensor network
Graph theory,Key distribution,Sensor node,Key distribution in wireless sensor networks,Expander graph,Computer science,Computer network,Network topology,Mobile wireless sensor network,Wireless sensor network,Distributed computing
Conference
ISSN
Citations 
PageRank 
1550-3607
11
1.15
References 
Authors
13
3
Name
Order
Citations
PageRank
seyit a camtepe126614.27
Bülent Yener2107594.51
Moti Yung3120801152.41