passing2006experimental
Abstract
Many security solutions have been proposed in the domain of wireless sensor networks (WSN). Usually, all these approaches are based on well-known cryptographic algorithms. The efficiency of WSN not only depends on effective routing decisions or energy aware wireless communication. In contrast, the efficiency strongly depends on the application scenario that includes appropriate security mechanisms. Previously, only few approaches were analyzed in experimental setups. Therefore, only theoretical measures were applied to demonstrate and discuss the behavior of security solutions. In this paper, we used an experimental setup for the verification of runtime behavior of several cryptographic algorithms including MD5, SHA-1, and AES. We used typical sensor hardware to get reasonable results. Based on our experiments, we provide some analysis and considerations on practical feasibility of such cryptographic algorithms in sensor networks.
Quick access
- Original Version (at publishers web site)
- BibTeX
Contact
- Martin Passing
- Falko Dressler
BibTeX reference
@inproceedings{passing2006experimental,
author = {Passing, Martin and Dressler, Falko},
title = {{Experimental Performance Evaluation of Cryptographic Algorithms on Sensor Nodes}},
booktitle = {3rd IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS 2006), 2nd IEEE International Workshop on Wireless and Sensor Networks Security (WSNS 2006)},
address = {Vancouver, Canada},
doi = {10.1109/MOBHOC.2006.278669},
month = {October},
pages = {882--887},
publisher = {Institute of Electrical and Electronics Engineers},
year = {2006},
}
Copyright notice
Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.
The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.
The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.
The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.
The following applies to all papers listed above that have IFIP copyrights: © IFIP, (YEAR). This is the author's version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in PUBLICATION, {VOL#, ISS#, (DATE)}, http://IFIP DL URL.