Detecting Selfish Nodes in MANETs

Abstract

Mobile Ad-hoc Networks(MANETs) is a self configured and decentralized wireless network without any prior infrastructure. Every node in it acts as a router as well as end-system and hence each node in MANET is allowed to move freely which makes routing difficult. Most of the MANET routing algorithms like AODV and DSR assumes that every node will forward every packet it receives. Source node will relay packets to the destination node through the intermediate nodes. However, misbehaviour of the selfish nodes is a common phenomenon in MANET. These nodes use the network and its services and do not provide any services to intermediate nodes in order to save energy such as battery, CPU power and bandwidth for relaying data from other nodes and reserve for themselves. These selfish nodes will degrade the performances of wireless ad hoc networks. However, we can identify the selfish nodes by modifying the original AODV and DSR routing algorithms. In this thesis, we proposed a time based scheme for identifying selfish nodes and perform the simulation using Network Simulator 2.34.