A Comparative Study of Routing Protocols for Minimum Path Cost Matric in MANETS
DOI:
https://doi.org//10.32628/CSEIT22829Keywords:
Path Cost, Metric, MANET, Reactive, Table driven, Topology, HybridAbstract
The Routing is the process of transmitting data packets from one node to another another node from source to destination The Mobile Adhoc Networks (MANETs ) doesn't have any fixed network structure or any centralized process to administer. The selection of the route is important for performance of packet transfer from source to destination. These routing protocol are classified as inter domain routing and Intra domain routing protocol. The routing protocols have been classified into Non Reactive , Reactive and Hybrid protocols. In the present paper we proposes to compare reactive routing protocols videlicet Ad hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR) protocols, Temporarily Ordered Routing Algorithm (TORA) and Associativity Grounded Routing (ABR) protocol.The Routing in MANETs is a one of the robustly and demanding task and has entered a great quantum of mindfulness from experimenters around the globe. To overcome this problem, a colorful number of routing classes have been introduced and the number is still rising day by day fastly. It's relatively hard to decide which protocols or routing classes may do well under an quantum of different network scripts similar as network volume and network topology etc. The study and performance of the above mentioned protocol has also been tabulated in the present two tables . The protocols are based on minimum power and temporary configuration of topology. The table 1 gives comparison of the main characteristics of routing protocols and Table2. provide comparison of various reactive routing protocol.
References
- Mobile ad hoc networks (MANET). http://www.ietf.org/html.charters/manet-charter.html, 1997. IETF Working Group Charter.
- C. E. Perkins and E. M. Royer, “Ad Hoc On-demand Distance Vector Routing,” In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90-100.
- Park V. and S. Corson, 2001. Temporary-ordered Routing Algorithm (TORA). Internet Draft, draft-ietf-manettoraspec-04.txt. 16 C. Perkins, Ad hoc On demand Distance Vector (AODV) routing.
- CHAI-KEONG TOH, Associativity-Based Routing for Ad-Hoc Mobile Networks, Wireless Personal Communications 4: pp.103–139, 1997.
- IETF Internet draft (1997), http://www.ietf.org/ internet-drafts/draft C. E. Perkins and P. Bhagwat, “Highly Dynamic Destination Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” SIGCOMM, London, UK, August 1994, pp. 234-244.
- https://tools.ietf.org/rfc/rfc4728.txt, D. Johnson, Y. Hu, D. Maltz, he Dynamic Source Routing Protocol (DSR).
- P. Agrawal et al., “A testbed for mobile networked computing”, in Proceedings of IEEE International Conference on Communications (ICC’95), June 1995, pp. 410–416.
- P. Agrawal, P.P. Mishra and M.B. Srivastava, “Network architecture for mobile and wireless ATM”, in Proceedings of 16th International Conference on Distributed Computing Systems (ICDCS ’96), May 1996
- Ramy Eltarras, Mohamed Eltoweissy, Associative routing for wireless sensor networks, Computer Communications, Volume 34, Issue 18, 2011, Pages 2162-2173, ISSN 0140-3664, https://doi.org/10.1016/j.comcom.2011.01.010. (https://www.sciencedirect.com/science/article/pii/S0140366411000326)
- @inproceedings{Kishor2013PerformanceAA, title={Performance Analysis and Challenges Wireless MANET Routing Protocols}, author={M Kishor}, year={2013}
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.