An Adaptive Routing Algorithm for Wireless Mesh Networks

Ad hoc networks can be very mobile, where mobile nodes (MNs) are moving frequently relative to one another. The faster the MNs are moving, the more the routing information is required to keep each MNs informed of the route information to other MNs. This paper proposes a hybrid routing algorithm, whose behavior is modified dynamically based on MN´s mobility in the network. This would allow using proactive algorithms when a network has low mobility, and allow using reactive algorithms when a network becomes very mobile. In this paper, destination sequenced distance vector (DSDV) is used as a proactive routing algorithm and ad hoc on-demand vector (AODV) is used as a reactive algorithm.