VLDD: Vindictive Link detection in Distance Vector Routine for ad hoc network

Abstract

In this paper we present a novel Vindictive Link detection enabled Distance Vector Routing Protocol (VLDD) for mobile ad hoc networks, through which the cost of working out and consumption of resources is bounded. While most of the existing models go for Digital Signature the proposed protocol is based on adept symmetric key cryptography with proactive routing topology called DSDV. This proposed protocol offers an efficient hash chaining technique in which each node in the routing path stores only one arcanum where as the hash chained based protocols obliges high storage memory as it requires to preserve multiple numbers of Aracnums. The other hash chaining protocols like SEAD uses multiple user authentications where as VLDD uses only one authentication tag for giving acknowledgements, and for fault declarations. By the efficient use of hash chain elements the metric values and the sequence numbers on the path can be secured from logical tampering. In contrast with the proactive routing topology called SEAD that cited frequently in literature about secure ad hoc routing provides security that limited to lower bound of the evaluation metrics, VLDD can provide total protection. We evaluated scalability of VLDD by comparing with state-of-the-art algorithms and observed that it is scalable, adaptive over a wide range of divergent situations under different number of assessment measures. In particular, we show that it scales better on networks with dense in node count. In this regard simulation model developed inNS-2 environment.