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. © IFIB International Federation for Information Processing 2007.
CITATION STYLE
Ünlü, A., Armaǧan, Ö., Levi, A., Savaş, E., & Erçetin, Ö. (2007). Key predistribution schemes for sensor networks for continuous deployment scenario. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4479 LNCS, pp. 239–250). Springer Verlag. https://doi.org/10.1007/978-3-540-72606-7_21
Mendeley helps you to discover research relevant for your work.