Analysis of Proactive Routing Protocols in MANET using Modified DVRA

Abstract

In this paper, we proposed a new modified distance vector routing (MDVR) based proactive routing algorithm for MANET, has been designed, implemented, and simulated in the laboratory. The count-to-infinity (CTI) problem in the DVR has been avoided and faster convergence has been achieved through some key modifications in the DVR algorithm rather than using sequence numbers which is used by several well-known routing algorithms under the same category. Each node in the MANET efficiently monitors its dynamic neighborhood using a novel state diagram approach and handles the losses and gains of neighbors in an intelligent and proactive manner. With a datagram approach to routing, based on three different types of packets, namely NNT, DVRT, and LEAVE, NMMDVR has avoided packet looping and reduced the loss of routes to a considerable extent. In the paper, we propose a new proactive routing algorithm for MANETs called Neighbourhood Management based Modified Distance Vector Routing for MANET or NMMDVR in short. It is based on some important modifications of the well-known and widely-used DVR algorithm (DVRA), which are incorporated in the algorithm Modified DVRA. These modifications allow the NMMDVR to avoid routing loops without the use of any sequence numbers (a concept used by several well-known routing algorithms for MANET) and offer reliable communication, even under the condition of high mobility.