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.

[1]  W.K.G. Seah,et al.  Topology-based capacity analysis for ad hoc networks with end-to-end delay constraints , 2004, Proceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication (IEEE Cat. No.04EX710).

[2]  Byoungchul Ahn,et al.  A Reverse AODV Routing Protocol in Ad Hoc Mobile Networks , 2006, EUC Workshops.

[3]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[4]  Jirí Matousek,et al.  Invitation to discrete mathematics , 1998 .

[5]  Chonggun Kim,et al.  A Leader Election Algorithm Within Candidates on Ad Hoc Mobile Networks , 2007, ICESS.

[6]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[7]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[8]  Ning Li,et al.  A matrix-based fast calculation algorithm for estimating network capacity of MANETs , 2005, 2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05).

[9]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.