International Journal of Smart Sensor and Adhoc Network


Major 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 re-routing instability problem. 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 (RD) Random Direction model, and we derive both exact and simple and approximate expressions of these probabilities. By obtained 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. The problem of link and route stability has been widely addressed in the literature. Routing protocols accounting for route stability while selecting the source-destination path can be found , just to name a few. Studies on link and path availability and duration are presented. A partially deterministic and a Brownian motion, where nodes start moving from the same location, are considered. Our objective is to derive the probability of path duration till time t and the probability of path availability at time t and Simulate with NS-2 Simulator at each and every node independently through out the path and observe results of path availability and path duration with respective to time t, Compare probability and simulator results to obtain route stability, so as to Improve routing efficiency as well by RDMobility Model



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.