Hash chains at the basis of a secure reactive routing protocol

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Presently, the main concern of ad hoc routing protocols is no longer to find an optimal route to a given destination but to find the safe route free from malicious attackers. Several secure ad hoc routing protocols proposed, in the literature, are based on public key cryptography which drawback is to consume much more resources and decrease consequently network performances. In this paper, we propose a secure routing scheme for the DSR protocol. The proposed scheme combines the hash chains and digital signatures to provide a high level of security while reducing the costs of hop-by-hop signature generation and verification. The proposed protocol is analyzed using the NS-2 simulator. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Bouabana-Tebibel, T. (2012). Hash chains at the basis of a secure reactive routing protocol. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7222 LNCS, pp. 258–270). https://doi.org/10.1007/978-3-642-32298-3_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free