Routing Algorithms in Manets

As we know almost all routing protocols are centralized in nature. Some of the major matrices or parameters used by routing protocols are hop count, bandwidth, delay, load, and reliability. These parameters are suitable for infrastructure based networks. But in Ad hoc Networks we require some efficient distributed and parallel routing approach. This makes route discovery process more reliable and provides high degree of link availability. Main objective of this research work is to propose a more efficient distributed route discovery process, using node mobility as parameter. This proposed algorithm is also compared with some centralized routing algorithms. We have evaluated this algorithm on the basis of Quality of Service parameters.