Hash based technique to identify the selfish node in Mobile Ad-hoc Network

Abstract

Mobile Ad-hoc NETwork (MANET) is a collection of mobile nodes that communicate with other node without any defined network. The node which decline to share its resource with other nodes is a selfish node. The main idea of selfish node is to drop the data packets and preserve the resource for its own use. The co-operation between the nodes is not guaranteed when the node behaves as selfish nodes. Most of the existing techniques use cryptographic algorithm such as Message Authentication Code (MAC), Rivest Shamir Adelman (RSA) etc, in identifying the selfish node. All of those techniques are take more time to find out the selfish node behavior. This paper applies hash function to identify the misbehaving node. The Hash function is a technique used in the Route Reply (RREP) to authenticate the message, which works in an efficient way. The result shows the better performance in terms of packet delivery ratio up to 70% and time delay has been reduced up to 80% compared to the existing Dynamic Source Routing (DSR) protocol.