Comparative study of Techniques used for Detection of Selfish Nodes in Mobile Ad hoc Networks
Dipali Koshti1, Supriya Kamoji2 

1Mrs. Dipali Koshti, Computer engg. Department, Fr. CRCE, Bandra, Mumbai, India.
2Mrs. Supriya Kamoji, Computer engg. Department, Fr. CRCE, Bandra, Mumbai, India.
Manuscript received on August 19, 2011. | Revised Manuscript received on August 29, 2011. | Manuscript published on September 05, 2011. | PP: 190-194 | Volume-1 Issue-4, September 2011. | Retrieval Number: D0119081411/2011©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: A MANET (Mobile Ad-hoc Network) is a self configuring system of mobile nodes connected by wireless links. MANETs are self-configuring and decentralized without having a fix infrastructure. In such a network each node acts as an endsystem as well as a relay node (or router). Most of the routing algorithms designed for MANET such as AODV and DSR are based on the assumption that every node forwards every packet. But in practice some of the nodes may act as the selfish nodes. These nodes use the network and its services but they do not cooperate with other nodes. Such selfish nodes do not consume any energy such as CPU power, battery and also bandwidth for retransmitting the data of other nodes and they reserve them only for themselves. The original AODV and DSR routing algorithms can be modified to detect such selfish nodes. This paper discusses two techniques namely Reputation based technique and Credit based technique used to detect selfish nodes in MANET. This paper discusses two algorithms that are based on reputation based technique and one algorithm based on credit based technique. Finally all three techniques have been compared.
Keywords: MANET, Selfish nodes in MANET, Misbehaving nodes in MANET, Cooperative system in MANET.