A New Approach to Overcome the Weakness in DVR Protocol Based on Component Neigbhour in MANET

By using the distance vector routing (DVR) protocols, each router over internetwork send the neighbouring routers, the information about destination that it knows how to reach and maintains a list of all destinations that only contains the cost of getting to that destination, and the next node to send the messages to. Thus, the source node only knows to which node to hand the packet, which in turn knows the next node (Next hop). This approach has an advantage of massively reduced storage costs compared to link-state algorithms. DVR algorithms are easier to implement and required less amount of required storage space and the actual determination of the route is based on the Bellman-Ford algorithm. Our objective was primarily intended to remove the weaknesses inherent in the widely used DVR algorithm, based on the well-known Bellman-Ford shortest path algorithm. In this paper, we introduce a new technique to solve the weakness in DVR named as component based neighbour routing that uses to create the distance vector routing table that would be truly dynamic, robust and free from the various limitations that have been discussed.