Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically exchange data among themselves without the need of fixed infrastructure or a wired backbone network. Due to limited transmission range of wireless network nodes, multiple hops are usually needed for a node to exchange information with any other node in the network. Thus routing is a crucial issue in the design of MANET. On-demand routing protocols for mobile ad hoc networks discover and maintain only the needed routes to reduce routing overheads. They use a flood-based discovery mechanism to find routes when required. Since each route discovery incurs high overhead and latency, the frequency of route discoveries must be kept low for on demand protocols to be effective. The wide availability of wireless devices requires the routing protocol should be scalable. But, as the size of the network increases the on demand routing protocols produce poor performance due to large routing overhead generated while repairing route breaks. The proposed multipath routing scheme provides better performance and scalability by computing multiple routes in a single route discovery. Also, it reduces the routing overhead by using secondary paths. This scheme computes combination of the node-disjoint path and fail-safe paths for multiple routes and provides all the intermediate nodes of the primary path with multiple routes to destination.