Optimized Routing by Excluding Selfish Nodes for MANET

Abstract

The Mobile nodes in MANET's are free to move randomly. Therefore, the network topology may change rapidly. Routing protocols for MANET are used for delivery of data packets from source to the desired destination. Routing protocols AODV are also designed based on the assumption that all the participating nodes are fully cooperative. However, due to the scarcity of available battery, node misbehaviors may exist. One such routing misbehaviors is that some nodes may be selfish as they take assistance of other nodes in route discovery and maintenance process, but refuse to forward the packet in order to save its resources. To solve this problem we propose a selfish node detection algorithm SIAODV that finds selfish node and calculates risk factor to find the optimum path (minimum risk path) for data forwarding. Most of the existing work focused on identification of selfish nodes but not on the selection of optimum path (minimum risk path) for data forwarding because shortest path may not be suitable in all the cases. The proposed solution presents a technique that identifies selfish nodes and finds the minimum risk path for data forwarding in Ad hoc On-demand Distance Vector (AODV) routing protocol for MANETs.

An Erlang factor-based conditional reliability mechanism for enforcing co-operation in MANETs

“…It is proved that TBUT is predominant in enhancing the network performance and improving the security of most of the real applications. Smitha et al [15] proposed a selfish node detection algorithm called SIAODV for quantifying the degree of risk incurred for estimating the optimum path incurred in packet forwarding. SIAODV focuses only on the minimum risk path in packet dissemination rather than shortest path of routing which is predominantly used in most of the existing mitigation approaches.…”