Taşçı, Emre Sinan and Bayramoğlu, Ersoy and Levi, Albert (2008) Simple and flexible random key predistribution schemes for wireless sensor networks using deployment knowledge. In: International Conference on Information Security and Assurance, 2008. ISA 2008., Busan, Korea
![[thumbnail of ABAB-ABCD-asseenatIEEE.pdf]](https://research.sabanciuniv.edu/style/images/fileicons/application_pdf.png)
ABAB-ABCD-asseenatIEEE.pdf
Restricted to Registered users only
Download (382kB) | Request a copy
Official URL: http://dx.doi.org/10.1109/ISA.2008.108
Abstract
Sensor nodes are tiny, low-power,
computationally limited and battery constrained
electromechanical devices that are usually deployed
for sensing some type of data in the field. Random key
predistribution mechanisms have been proposed to
provide security for wireless sensor networks. In the
literature, there are well known random key
predistribution schemes. Some of these schemes are
secure, but quite complex to apply, while some other
are easily applicable but they do not offer reasonable
security. In this paper, we propose random key
predistribution schemes for wireless sensor networks
that provide varying ranges of security and that are
easily applicable due to their simplicity. In this respect,
our schemes serve as a tradeoff. Moreover, our
proposed schemes show a good extensibility property.
We assume prior deployment knowledge. We examine
performance of our schemes and compare them with
well known random key predistribution schemes.
Item Type: | Papers in Conference Proceedings |
---|---|
Divisions: | Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng. |
Depositing User: | Albert Levi |
Date Deposited: | 11 Nov 2008 22:32 |
Last Modified: | 26 Apr 2022 08:48 |
URI: | https://research.sabanciuniv.edu/id/eprint/10487 |