Secure anonymous routing for MANETs using distributed dynamic random path selection

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

Abstract

Most of the MANET security research has so far focused on providing routing security and confidentiality to the data packets, but less has been done to ensure privacy and anonymity of the communicating entities. In this paper, we propose a routing protocol which ensures anonymity, privacy of the user. This is achieved by randomly selecting next hop at each intermediate. This protocol also provides data security using public key ciphers. The protocol is simulated using in-house simulator written in C with OpenSSL crypto APIs. The robustness of our protocol is evaluated against known security attacks. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Mohanty, V., Moliya, D., Hota, C., & Rajarajan, M. (2010). Secure anonymous routing for MANETs using distributed dynamic random path selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6122 LNCS, pp. 65–72). https://doi.org/10.1007/978-3-642-13601-6_8

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