| Routing class | GSR | GPSR | LAR |
| Routing structure | Flat | Periodic beaconing | Location-based |
| Routing metric | Shortest Path | Closest distance | Shortest Path |
| Communication overhead | High | High | lower |
| Weaknesses | High delay at high mobility and High Memory Overhead | Delay increases at high mobility, generates a large number of control packets for high speeds, don’t have better performance as the inter-beacon interval and group Leader is Single Point of Failure and low packet delivery ratio | Request the destination location, which might create contacting or tracking problem and Control complexity is higher than GPSR. |
| Strengths | Shortest path to the destination and Localized updates | Guarantees a good Packet Delivery Ratio especially in the high density of nodes, Keeps a good rate of delivery in networks with high mobility, generates routing protocol traffic in quantity independent of the length of the routes through the network and low data forwarding overhead and local maxima can be found easily | Decrease the search space results in little route discovery messages and it has minimized the size of the route discovery process by defining the range of the destination node. |