If not, one can always modify routing behavior using policy based routing and adjusting attributes with route maps.
The function h(x) can be used to derive hop count optimal route discovery based routing.
So control overhead becomes extremely high in cluster based routing protocols compared to location based routing protocols for source routing.
Additionally, SARP overcomes the shortcoming of topology based routing and optimum local situation of geographically based routing protocols by considering the global and local community acquaintance of nodes.
Underwater Acoustic Networks (UANs), where most of the nodes operate on battery power, prefer topology-based routing metrics over active probing based routing metrics.
Most of the existing load aware based routing try to dynamically adjust the routes to balance the real time traffic based on the knowledge of current load distribution, which is not very scalable for large wireless networks.
In such scenario, the greedy forwarding (GF) position based routing is an interesting algorithm to efficiently route packets from vehicles to the destination.
So, it is desirable to define routes at the source like in source based routing (SBR) while performing greedy forwarding at intermediate nodes.
This detail makes a straightforward comparison with other cluster-based solutions in the literature (e.g., the Mesh Cluster Based Routing Protocol (MCBRP) [19]) pointless.
In this section, we will distinguish how to make the gradient-base routing model using depth and traffic loading, respectively, and then how to integrate them together to make dynamic routing decision.
