Performance Comparison and Analysis of Table-Driven and On-Demand Routing Protocols for Mobile Ad-hoc Networks

Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such an ad hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols for mobile ad hoc networks– the Destination Sequenced Distance Vector (DSDV), the table- driven protocol and the Ad hoc On- Demand Distance Vector routing (AODV), an On –Demand protocol and evaluates both protocols based on packet delivery fraction, normalized routing load, average delay and throughput while varying number of nodes, speed and pause time.

Authors:

• Narendra Singh Yadav
• R.P.Yadav

Keywords:

• AODV
• DSDV
• MANET
• relative performance

References:

[1] E. M. Royer and C. K. Toh, "A review of current routing protocols for
ad hoc mobile wireless networks," IEEE Personal Communications
magazine, April 1999, pp. 46-55.
[2] C. E. Perkins and P. Bhagwat, "Highly Dynamic Destination-Sequenced
Distance-Vector Routing (DSDV) for Mobile Computers," in
Proceedings of ACM SIGCOMM 1994, August 1994, pp. 234-244.
[3] S. Murhty and J. J. Garcia-Luna-Aceves, "An Efficient Routing
Protocol for Wireless Networks," ACM Mobile Networks and
Applications Journal, Special Issue on Routing in Mobile
Communication Networks, Vol. 1, no. 2, October 1996, pp. 183-197.
[4] C. C. Chiang, H. K. Wu, W. Liu and M. Gerla, "Routing in Clustered
Multi-Hop Mobile Wireless Networks with Fading Channel," in
Proceedings of IEEE SICON 1997, April 1997, pp. 197-211.
[5] J. J. Garcia-Luna-Aceves and M. Spohn, "Source-Tree Routing in
Wireless Networks," in Proceedings of IEEE ICNP 1999, October 1999,
pp. 273-282.
[6] D. B. Johnson and D. A. Malta, "Dynamic Source Routing in Ad Hoc
Wireless Networks," Mobile Computing, Kluwer Academic Publishers,
vol. 353, 1996, pp. 153-181.
[7] C. E. Perkins and E. M. Royer, "Ad Hoc On-Demand Distance Vector
Routing," Proceedings of IEEE Workshop on Mobile Computing
Systems and Applications 1999, February 1999, pp. 90-100.
[8] V. D. Park and M. S. Corson, "A Highly Adaptive Distributed Routing
Algorithm for Mobile Wireless Networks," in Proceedings of IEEE
INFOCOM 1997, April 1997, pp. 1405-1413.
[9] Y. Ko and N. H. Vaidya, "Location-Aided Routing (LAR) in Mobile Ad
Hoc Networks," in Proceedings of ACM MOBICOM 1998, October
1998, pp. 66-75.
[10] C. K. Toh, "Associativity-Based Routing for Ad Hoc Mobile Networks,"
Wireless Personal Communications, vol. 4, no. 2, March 1997, pp. 1-36.
[11] P. Sinha, R. Shivkumar and V. Bharghavan, "CEDAR: A Core
Extraction Distributed Ad Hoc Routing Algorithm," IEEE Journal on
Selected Areas in Communications, vol. 17, no. 8, August 1999, pp.
1454-1466.
[12] Z. J. Haas, "The Routing Algorithm for the Reconfigurable Wireless
Networks," in Proceedings of ICUPC 1997, vol. 2, October 1997, pp.
562-566.
[13] R. S. Sisodia, B. S. Manoj and C. Siva Ram Murthy, "A Preferred Link-
Based Routing Protocol for Ad Hoc Wireless Networks," Journal of
Communications and Networks, vol. 4, no. 1, march 2002, pp. 14-21.
[14] Andrew S. Tanenbaum, Computer Networks. Fourth Edition, Prentice
Hall, ch. 5, pp. 357-360.
[15] Andrew S. Tanenbaum, Computer Networks. Fourth Edition, Prentice
Hall, ch. 5, pp. 360-366.
[16] K. Fall and K. Vardhan, The Network Simulator (ns-2). Available:
http://www.isi.edu/nsnam/ns
[17] T. S. Rappaport, Wireless Communications, Principles & Practices.
Prentice Hall, 1996, ch. 3, pp. 70-74.