Analysis to Identify of AODV Routing Protocol works In Network
Keywords:
Distant vector algorithm, On-demand Distance Vector, time-stamping, next hop.Abstract
AODV is a relative of the Bellman-Ford distant vector algorithm, anyway is changed in accordance with work in an adaptable environment. AODV chooses a course to a target exactly when a center point needs to send a bundle to that goal. AODV (Ad-hoc On-demand Distance Vector) [1] is a circle free controlling show for unrehearsed associations. It is planned to act normally starting in an environment of adaptable centers, withstanding an arrangement of association rehearses like center point convenience, interface frustrations and pack adversities at each center point, AODV keeps a coordinating table. The controlling table area for a target contains three essential fields: a next bob center point, a course of action number and a leap check. All bundles bound to the goal are transported off the accompanying leap center. The progression number goes probably as a sort of time-venturing, and is an extent of the freshness of a course. The ricochet check tends to the current distance to the goal center point.
References
- Schiller J. Mobile Communications. Addison Wesley, 2nd edition, 2003.
- Royer E.M. Perkins C.E. Ad-hoc on-demand distance vector routing. Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, p.90, 1999.
- Das S. Perkins C.E., Belding-Royer E.M. Ad-hoc on-demand distance vector (aodv) routing. RFC 3561, IETF Network Working Group, 2003.
- David B, Johnson, David A.Malta, Yih-Chun Hu. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks(DSR). IEIF Internet Draft, draft_ietf_manet_dsr_09.txt
- Pucha H. Hu Y.C. Koutsonikolas D., Das S.M. On optimal ttl sequence-based route discovery in manets. volume vol.9, p.923, 2005.
- Schneider S. Kaddoura M., Ramanujan R. Routing optimization techniques for wireless ad hoc networks. Proceedings of the Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks SNPD/SAWN 2005, p.454, 2005.
- Liu M. Chang N. Revisiting the ttl-based controlled flooding search: Optimality and randomization. I n Proc. of ACM MobiCom, September, 2003.
- Perkins C.E. Lee S.-J., Belding-Royer E.M. Scalability study of the ad-hoc on-demand distance vector routing protocol. Int. J. Netw. Manag., 13(2), 2003.
- Tanenbaum A.S. Computer Networks. Prentice Hall International, 4th edition, 2003.
- Jha S. Hassan J. On the optimization trade-offs of expanding ring search. Springer Verlag, 2004.
- Belding-Royer E.M. Chakeres I.D. Aodv routing protocol implementation design. 2003.
- Lee S J, Gerla M. Dynamic load-aware routing in ad hoc net-works. IEEE International Conference on 2001. 10: 3206-3210.
- Fang Lu ping, Liu Shi hua, Chen Pan, etc. NS-2 network simulation Fundamentals and Applications. Bei Jing: National Defence Industry Press. 2008: 147-148.
- Floriano De Rango, Mauro Tropea. Energy Saving and Load Balancing in Wireless Ad Hoc Networks through Ant-based Routing[C]. International conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems. Istanbul. 2009: 117-124.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.