Abstract
In this paper we studied various routing algorithms for ad hoc networks to explain why Ad hoc On Demand Distance Vector (AODV) should be chosen over other possible rotuing algorithms. We then the effect of applying encryption over AODVÂ [5] to data payload on different parameters such as delay, queue size, throughput, retransmission attempts, channel back-off etc.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rc4 encryption algorithm, history and description, http://www.ncat.edu/grogans/algorithm_history_and_description.htm
Garg, V., Ghosh, R.K.: Effect of data encryption on wireless ad hoc networks performance. Technical report, IIT-Kanpur, Department of CSE (2003)
Zhou, L., Haas, Z.J.: Securing adhoc networks. IEEE Network Magazine 13(6) (1999)
Perkins, C.: Ad hoc on demand distance vector (aodv) routing. Internet draft, draft-ietf-manet-aodv-00.txt
Royer, E.M., Toh, C.-K.: A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Magazine on Personal Communication 17(8), 46–55 (1999)
Toh, C.-K.: Ad Hoc Mobile Wireless Networks – Protocols and Systems. Prentice Hall, Upper Saddle River (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garg, V.K., Ghosh, R.K. (2004). Effect of Data Encryption on Wireless Ad Hoc Network Performance. In: Sen, A., Das, N., Das, S.K., Sinha, B.P. (eds) Distributed Computing - IWDC 2004. IWDC 2004. Lecture Notes in Computer Science, vol 3326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30536-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-30536-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24076-1
Online ISBN: 978-3-540-30536-1
eBook Packages: Computer ScienceComputer Science (R0)