Multipath Routing in Adhoc Networks  

     u Brindhaselvi Lokanathan     v     Nisha Mary

          In our project, we propose a routing scheme that uses multiple paths simultaneously by splitting the information among the multitude of  paths,to increase the probability that the essential portion of the information is received at the destination without incurring excessive delay.

           In this Routing scheme, we have to add some overhead to each packet, which is calculated as a linear function of the original packet bits. The information plus overhead is fragmented into smaller blocks and distributed over the available paths. Given the failure probabilities of the path, we have to find the optimal way to fragment and then distribute the blocks to the paths so that the probability of reconstructing the original information at the destination is maximized.

         This Routing scheme is implemented using the simulator language Network Simulator which uses C++ as frontend and OTCL as interpreter.