A Mobile Ad-Hoc Routing Algorithm with Comparative Study of Earlier Proposed Algorithms

Kumar Verma Pawan, Gupta Tarun, Rakesh Nitin, Nitin Nitin
DOI: 10.4236/ijcns.2010.33037                

Abstract

A mobile ad-hoc network is an autonomous collection of mobile nodes that communicate over bandwidth constrained wireless links. Due to nodal mobility, the network topology may change rapidly and unpredictably over time. The routing protocols meant for wired network cannot be used for mobile ad-hoc network because of mobility of network. A number of routing protocols like Destination-Sequenced Distance-Vector (DSDV), Ad-Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Temporally Ordered Routing Algorithm have been implemented. The ad-hoc routing protocols can be divided into two classes; Table-Driven and On-Demand. 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 propose an algorithm that facilitates efficient routing of the packet and failure recovery mechanism

Keywords

AODV, DSDV, Relative Performance

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	C. E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” In Proceedings of ACM SIGCOMM, pp. 234–244, August 1994.
[2]	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, pp. 183–197, October 1996.
[3]	J. J. Garcia-Luna-Aceves and M. Spohn, “Source-tree routing in wireless networks,” In Proceedings of IEEE ICNP, pp. 273–282, October 1999.
[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, pp. 197–211, April, 1997.
[5]	D. B. Johnson and D. A. Malta, “Dynamic source routing in ad hoc wireless networks,” Mobile Computing, Klu- wer Academic Publishers, Vol. 353, pp. 153–181, 1996.
[6]	T.-W. Chen, J. T. Tsai, and M. Gerla, “QoS routing performance in multihop, multimedia, wireless networks,” IEEE 6th ICUPC Record, pp. 557–561, October 1997.
[7]	V. D. Park and M. S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” In Proceedings of IEEE INFOCOM 1997, pp. 1405–1413, April 1997.
[8]	C. K. Toh, “Associativity-based routing for ad hoc mobile networks,” Wireless Personal Communications, Vol. 4, No. 2, pp. 1–36, March 1997.
[9]	M. G. Kaosar, M. Hafiz, M. A. Tarek, R. Sheltami, and A. S. H. Mahmoud, “Simulation-based comparative study of on demand routing protocols for MANET,” International Conference on Wireless Networking and Mobile Computing (ICWNMC’05), Chennai, India, Vol. 1, pp. 201–206, 28– 30 December 2005.
[10]	K. Takanashi, T. Kato, S. Itoh, A. Sugata, F. Kojima, and M. Fujise, “Combining AODV ad hoc routing and conventional IP routing over wireless and wired links,” Proceedings of Communication Systems and Networks, 2005.
[11]	Technical report. http://www.cs.umu.se/education/exami- na/Rapporter/KrishnaGorantala.pdf.
[12]	Technical report. http://en.wikipedia.org/wiki/DSDV.
[13]	T. Yang, M. Ikeda, G. De Marco, and L. Barolli, “Performance behavior of AODV, DSR and DSDV protocols for different radio models in ad-hoc sensor networks,” 2007 International Conference on Paralled Processing Workshops, 10–14 September 2007.
[14]	E. M. Royer and C. K. Toh, “A review of current routing protocols for ad hoc mobile wireless networks,” IEEE Personal Communications Magazine, pp. 46–55, April 1999.
[15]	C. E. Perkins and E. M. Royer, “Ad hoc on-demand distance vector routing,” Proceedings of IEEE Workshop on Mobile Computing Systems and Applications, pp. 90– 100, February 1999.
[16]	Technical report. http://en.wikipedia.org/wiki/AODV.
[17]	G. D. Nguyen and S. Kompella “Optimization of trans- mission schedules in captured-based wireless networks”.
[18]	Z. Zhang, S. Moola, and E. K. P. Chong, “Approximate stochastic dynamic programming for opportunistic fair scheduling in wireless networks,” Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, 9–11 December 2008.
[19]	G. Forman and J. Zahorjan, “The challenges of mobile computing,” IEEE computer, Vol. 27, No. 4, April 2001.