A fundamental issue arising in mobile ad hoc networks (MANETs) is the selection of the optimal path between any two nodes. A method that has been advocated to improve routing efficiency is to select the most stable path so as to reduce the latency and the overhead due to route reconstruction. In this work, we study both the availability and the duration probability of a routing path that is subject to link failures caused by node mobility.
In particular, we focus on the case where the network nodes move according to the Random Direction model, and we derive both exact and approximate (but simple) expressions of these probabilities. Through our results, we study the problem of selecting an optimal route in terms of path availability. Finally, we propose an approach to improve the efficiency of reactive Routing protocols
We focus on the stability of a routing path, which is subject to link failures caused by node mobility. We define the path duration as the time interval from when the route is established until one of the links along the route becomes unavailable, while we say that a path is available at a given time instant t when all links along the path are active at time t . Then, our objective is to derive the probability of path duration till time t and the probability of path availability at time t
• Networking module.
• Random Direction mobility model.
• Link availability module.
• Multi Hop module.
Optimal path selection module
System : Pentium IV 2.4 GHz.
Hard Disk : 40 GB.
Floppy Drive : 1.44 Mb.
Monitor : 15 Vga Colour.
Mouse : Logitech.
Ram : 256 MB
Operating system : - Windows XP Professional.
Front End : - ASP.Net 2.0.
Coding Language :- Visual C# .Net