Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Short paths in expander graphs
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A survey of key management schemes in wireless sensor networks
Computer Communications
An Application-Oriented Framework for Wireless Sensor Network Key Establishment
Electronic Notes in Theoretical Computer Science (ENTCS)
Key Refreshing in Wireless Sensor Networks
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
From key predistribution to key redistribution
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Deterministic key predistribution schemes for distributed sensor networks
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
On optimality of key pre-distribution schemes for distributed sensor networks
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
| Hi-index | 0.00 |
Providing security for a wireless sensor network composed of small sensor nodes with limited battery power and memory can be a non-trivial task. A variety of key predistribution schemes have been proposed which allocate symmetric keys to the sensor nodes before deployment. In this paper we examine the role of expander graphs in key predistribution schemes for wireless sensor networks. Roughly speaking, a graph has good expansion if every 'small' subset of vertices has a 'large' neighbourhood, and intuitively, expansion is a desirable property for graphs of networks. It has been claimed that good expansion in the product graph is necessary for 'optimal' networks. We demonstrate flaws in this claim, argue instead that good expansion is desirable in the intersection graph, and discuss how this can be achieved. We then consider key predistribution schemes based on expander graph constructions and compare them to other schemes in the literature. Finally, we propose the use of expansion and other graph-theoretical techniques as metrics for assessing key predistribution schemes and their resulting wireless sensor networks.