Computer Science – Cryptography and Security
Scientific paper
2010-05-02
International Journal of Computers, Information Technology and Engineering (IJCITAE), Vol. 1, No. 1, pp 9-15, June 2007, Seria
Computer Science
Cryptography and Security
15 Pages, 6 Figures, 1 table, 3rd International Conference on Computers and Devices for Communication (CODEC-06) Institute of
Scientific paper
Reactive routing protocols like Ad Hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR)in Ad-Hoc Wireless Networks which are used in Mobile and Ad Hoc Networks (MANETs) work by flooding the network with control packets. There is generally a limit on the number of these packets that can be generated or forwarded. But a malicious node can disregard this limit and flood the network with fake control packets. These packets hog the limited bandwidth and processing power of genuine nodes in the network while being forwarded. Due to this, genuine route requests suffer and many routes either do not get a chance to materialize or they end up being longer than otherwise. In this paper we propose a non cryptographic solution to the above problem and prove its efficiency by means of simulation.
Dhekne P. S.
Kataria Jayesh
Sanyal Sugata
No associations
LandOfFree
ACRR: Ad Hoc On-Demand Distance Vector Routing with Controlled Route Requests does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with ACRR: Ad Hoc On-Demand Distance Vector Routing with Controlled Route Requests, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and ACRR: Ad Hoc On-Demand Distance Vector Routing with Controlled Route Requests will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-723903