Ad-hoc On-Demand Distance Vector Routing

Ad-hoc On-Demand Distance Vector Routing

| Charles E. Perkins, Elizabeth M. Royer
AODV (Ad-hoc On-Demand Distance Vector Routing) is a routing protocol designed for ad-hoc networks, which are networks of mobile nodes without a centralized access point or existing infrastructure. AODV allows nodes to dynamically establish routes on demand, minimizing reliance on periodic advertisements. It ensures loop-free routing by using destination sequence numbers, which help maintain up-to-date and valid routes. AODV is efficient in terms of bandwidth usage and is suitable for large-scale ad-hoc networks. The protocol is designed to handle dynamic changes in network topology, such as node movement or link failures, by maintaining current routing information and quickly re-establishing routes when needed. AODV also includes mechanisms for local connectivity management, such as hello messages, to detect neighbor changes and maintain symmetric links. The protocol has been evaluated through simulations, showing its effectiveness in various network sizes and conditions. AODV is scalable, efficient, and suitable for applications requiring reliable and dynamic routing in ad-hoc networks. Future work includes improvements such as multicast support, intermediate node route rebuilding, and the elimination of hello messages to reduce control overhead. AODV is considered an excellent choice for ad-hoc network establishment due to its ability to handle large populations of nodes and maintain loop-free routes.AODV (Ad-hoc On-Demand Distance Vector Routing) is a routing protocol designed for ad-hoc networks, which are networks of mobile nodes without a centralized access point or existing infrastructure. AODV allows nodes to dynamically establish routes on demand, minimizing reliance on periodic advertisements. It ensures loop-free routing by using destination sequence numbers, which help maintain up-to-date and valid routes. AODV is efficient in terms of bandwidth usage and is suitable for large-scale ad-hoc networks. The protocol is designed to handle dynamic changes in network topology, such as node movement or link failures, by maintaining current routing information and quickly re-establishing routes when needed. AODV also includes mechanisms for local connectivity management, such as hello messages, to detect neighbor changes and maintain symmetric links. The protocol has been evaluated through simulations, showing its effectiveness in various network sizes and conditions. AODV is scalable, efficient, and suitable for applications requiring reliable and dynamic routing in ad-hoc networks. Future work includes improvements such as multicast support, intermediate node route rebuilding, and the elimination of hello messages to reduce control overhead. AODV is considered an excellent choice for ad-hoc network establishment due to its ability to handle large populations of nodes and maintain loop-free routes.
Reach us at info@futurestudyspace.com
[slides and audio] Ad-hoc on-demand distance vector routing