Key predistribution schemes for sensor networks for continuous deployment scenario

Warning The system is temporarily closed to updates for reporting purpose.

Ünlü, Abdülhakim and Armağan, Önsel and Levi, Albert and Savaş, Erkay and Erçetin, Özgür (2007) Key predistribution schemes for sensor networks for continuous deployment scenario. In: 6th International IFIP-TC6 Networking Conference, Atlanta GA USA

Full text not available from this repository.


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, re-siliency, memory usage and communication cost for key establishment.

Item Type:Papers in Conference Proceedings
Subjects:Q Science > QA Mathematics > QA075 Electronic computers. Computer science
ID Code:5582
Deposited By:Albert Levi
Deposited On:17 Oct 2007 15:16
Last Modified:22 May 2019 12:05

Repository Staff Only: item control page