A Routing Protocol Based on Distance Vector in Ad Hoc Networks

Since ad hoc network does not rely on existing infrastructure and is self-organized, the nodes on such network act as hosts and routers to transmit packets. With its intense change in topology ad hoc network does not relay on pre-established cable network, but it requires special routing algorithm. We provide a specific shortest routing protocol based on distance vector and adjacency matrix and compare the performance of the proposed routing protocol with those of AODV and DSDV by computer simulations using NS-2. By the main comparison results, the proposed protocol shows better performance on data delivery ratio, end-to-end delay, and control overheads.