| Routing class | AODV | TORA | ABR |
| Multiple routes | No | Yes | No |
| Route metric method | Freshest and Shortest path | Shortest path or next available | Strongest Associatively and Shortest path |
| Route reconfiguration strategy | Erase route then source notification or local route repair | Link reversal and Route Repair | Localized Broadcast Query |
| Weaknesses | Periodic beaconing result in excessive bandwidth consumption, the intermediate nodes might result in inconsistent routes, Scalability problems, Large delays and Hello messages | In large networks the overhead, consume a large bandwidth, Temporary routing loops and Overall complexity | Lack loops, deadlock, and packet duplicates, Scalability problems, High Overhead and Overall complexity |
| Strengths | AODV has potentially less routing overheads, Adaptive to highly, Dynamic topologies and Low overhead | Able to rapidly build routes and decrease the communication’s overhead, Multiple routes | Longer-lived routes, Route stability |