Reliable ad-hoc on-demand distance vector routing protocol
Published in International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06), 2006
Recommended citation: Sandhya Khurana, Neelima Gupta, Nagender Aneja "Reliable ad-hoc on-demand distance vector routing protocol." International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06), 2006. pp. 98--98 doi: 10.1109/ICNICONSMCL.2006.183 https://ieeexplore.ieee.org/document/1628344
Reliable-ad-hoc-on-demand-distance-vector-routing-protocol
Reliable-ad-hoc-on-demand-distance-vector-routing-protocol
(Conference Publication)
Abstract: Mobile Ad hoc Networks (MANETs) properties present major vulnerabilities in security. The threats considered in MANETS are due to maliciousness that intentionally disrupt the network by using a variety of attacks and due to the selfishness of nodes that do not perform certain operations due to a wish to save power. This paper proposes a cooperative security scheme called Reliable Ad hoc On-demand Distance Vector (RAODV), a routing protocol based on local monitoring, to solve the problem of attack by malicious nodes and selfish behavior. RAODV behaves as AODV in the absence of an attack and detects and isolates misbehaving nodes in the presence of an attack. Also, it recovers from the attack when a misbehaving node leaves the network or becomes good.
Recommended citation: ‘Sandhya Khurana, Neelima Gupta, Nagender Aneja "Reliable ad-hoc on-demand distance vector routing protocol." International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06), 2006. pp. 98–98 doi: 10.1109/ICNICONSMCL.2006.183’