Abstrait

Prevention of Selfish Node in MANET Using ERAODV Protocol

S.Archana , S. Roselin Mary and G.ArunKumar

In mobile ad hoc networks (MANETs), communications between nodes are taken place only through the cooperation of nodes in the networks. Most of the protocols and algorithms used in MANET, are assuming that all mobile nodes cooperate fully with the functionalities of the network. But some nodes are cooperate partially or not at all cooperating with other nodes. Hence network performance and data accessibility, accessing time, query delay are affected by these selfish nodes. Reputation Systems and Price-Based Systems are two main solutions to the node noncooperation problem. A reputation system evaluates node behaviors by reputation values and uses a reputation threshold to distinguish trustworthy nodes and untrustworthy nodes. A price based system uses virtual cash to control the transactions of a packet forwarding service. Although these two kinds of systems have been widely used, has been devoted to investigating the effectiveness of the node cooperation incentives provided by the system.In this paper, a new efficient Protocol called Enhanced Reverse Ad Hoc On Demand Vector Routing Protocol (ERAODV), which uses Hybrid Reputation System (HRS) proposed to detect selfish nodes and make node as self cooperative with other node and prevent the intrusion attack and ensure the trustworthiness of nodes in MANET, which is a modified version of AODV with enhanced packet delivery ratio and minimized end to end delay.