Mobile Ad-hoc network (MANET) is a collection of mobile nodes, which form a wireless network without the use of an existing infrastructure. MANET's are usually characterized by random mobility of nodes, nodes arbitrarily entering and leaving the network and variable transmission range of nodes. These characteristics make MANET links to be intermittent and the topology to be highly dynamic. The objective of a routing protocol is to efficiently find routes and transfer as many data-packets possible with minimum routing overhead. In such situations routing protocols are desired to be on-demand and robust enough to cope up with the dynamic topology changes. Many on demand routing protocols have been suggested for this purpose like single path Dynamic source routing (DSR) and Ad-hoc on demand distance vector routing (AODV) and their multiple path variants like Ad-hoc on demand multiple distance vector routing (AOMDV). These protocols suggest different ways to avoid route-looping problems and create shortest path route. Locally adaptive Ad-hoc on demand distance vector routing (PROPOSED-AOMDV) tries to discover more robust routes and proposes new schemes to provide route maintenance. In our thesis work we propose to compare the different techniques of path maintenance, mainly link layer detection and hello based connectivity. The goal is to analyze the behavior of different single path and multipath schemes for these mechanisms. With the increasing need to be able to send video traffic over mobile ad-hoc networks, it becomes critical to be able to send packets within a time constraint. Hence we have chosen to bring in a factor called 'time to live' or TTL. The scheme culminates with the introduction of a queue between the network and the MAC layer, i.e., the Interface Queue Layer in order to sort packets based on their priority. This scheme ensures that higher importance packets are always sent ahead of lower priority packets.