Skip to Main Content
In this paper, we present routing algorithms for mobile ad-hoc networks, which exploit the mobility patterns of nodes to provide a robust and long-lived route to destination and reduce flooding and overhead in the network. In the proposed protocols, only a small number of the network nodes are selected based on their Heading Direction Angle (HDA), to form a route from the source to the destination node. These approaches give solutions to some of the problems encountered in ad hoc networks, such as handling the frequent changes in the network topology due to mobility; maintaining the long-lived multi-hop paths between two communicating nodes. The obtained results show how these algorithms reduced the overhead and flooding in the network, and increased the life of the route in comparison with other routing protocols, such as Ad hoc On-demand Distance Vector (AODV). The new three approaches discussed in this paper could be applied to other routing protocols for mobile ad hoc networks in order to improve the performance of these protocols.