Grilling Gratuitous Detour in ADHOC Network

Abstract

Routing is a critical function in adhoc network which claim special attention and support extended by the trustable neighbor nodes. The peril of Gratuitous detour on routing process in ad hoc network is manifold which culminates in the deterioration of network performance amounting to deplorable network behavior. Routing in ad hoc network is a cooperative process as it requires periodic assistance from the intermediate nodes to route the packets to the far off nodes that are beyond the direct wireless transmission range. The role of intermediate nodes in routing is crucial and it mandates special attention and support from the sender node and as well the good Samaritan neighboring nodes. This paper advocates the creation of two lists namely PFL and SFL backed by Dominant Pruning Method. The misbehaving middle node exhibiting Gratuitous Detour (GD) has to be curtailed by performing a cardinality operation on the route cache (storing the intermediate nodes enroute to the destination) of the nodes in PFL and SFL. The sender node stringent process of recruiting the genuine intermediate nodes in both the list is echoed periodically by performing a cardinal operation to restrain the occurrence of GD which manifest by projecting a non existent node or concealing an existent node. The result of the cardinal operation approves the truth that the nodes in Route cache (Buffered Route Path) are genuine or not. The proposed solution demands a heavy pay from the M 3 N whose intention is either to disrupt the optimal routing process by hiding a potential peer after launching a blackmail or DoS attack on it. The ulterior motive of the Malicious Misbehaving Middle (M 3 N) in projecting the non existent nodes (Longer Virtual Route) to evade the role of routing intermediary is also effectively thwarted. Suitable graph have been simulated to study the effect of mobility and no. of misbehaving nodes on the Sender Node Probing Latency Index (SNPLI).