Key predistribution schemes for sensor networks for continuous deployment scenario

Authors:
Abdülhakim Ünlü;Önsel Armaǧan;Albert Levi;Erkay Savas;Özgür Erçetin
Affiliations:
Sabanci University, Istanbul, Turkey;Sabanci University, Istanbul, Turkey;Sabanci University, Istanbul, Turkey;Sabanci University, Istanbul, Turkey;Sabanci University, Istanbul, Turkey
Venue:
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Year:
2007

Citing 10
Cited 1

An optimal class of symmetric key generation systems

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
A pairwise key pre-distribution scheme for wireless sensor networks

Proceedings of the 10th ACM conference on Computer and communications security
Establishing pairwise keys in distributed sensor networks

Proceedings of the 10th ACM conference on Computer and communications security
LEAP: efficient security mechanisms for large-scale distributed sensor networks

Proceedings of the 10th ACM conference on Computer and communications security
Location-based pairwise key establishments for static sensor networks

Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Location-aware key management scheme for wireless sensor networks

Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Group-based key pre-distribution in wireless sensor networks

Proceedings of the 4th ACM workshop on Wireless security
A survey on sensor networks

IEEE Communications Magazine

Simple, extensible and flexible random key predistribution schemes for wireless sensor networks using reusable key pools

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In sensor networks, secure communication among sensor nodes requires secure links and consequently secure key establishment. Due to resource constraints, achieving such key establishment is non-trivial. Recently some random key predistribution techniques have been proposed to establish pairwise keys. Some of these approaches assume certain deployment knowledge is available prior to deployment and nodes are deployed in groups/bundles. In this paper, we propose another practical deployment model where nodes are deployed over a line one by one in a continuous fashion. In this model, sensor nodes can also be deployed over multiple parallel lines to cover two-dimensional area. Based on this model, we develop two key predistribution schemes. Analysis and simulation results show that our key predistribution schemes make use of the deployment knowledge better than the existing schemes. Thus they perform better than other location-aware protocols using the metrics of connectivity, resiliency, memory usage and communication cost for key establishment.