NEIGHBORING NODE BASED SYSTEM FOR MANET TO DETECT SELFISH NODES USING NS2
Sagar Damodar Padiya, Rakesh Pandit, Sachin Patel, Tanuj S. Rohankar, M. Tech · 2013
An Ad-hoc network is a collection of mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administer. Because of limited communication range among MANET, several network hopes may be needed to deliver a packet from one node to another node in the wireless network. In such a network each node acts as an end system 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 [01]. 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 [07]. In this paper, we present a new neighboring node based mechanism to detect those selfish nodes in MANET and perform the simulation using Network Simulator-2(Version-2.32). Each node is expected to contribute to the network on the continual basis within a time frame. Those which fail will undergo a test for their suspicious behavior. Simulation results show that our neighboring node based system could be used to detect selfish nodes in a network.