Ubiquitous Computing and Communication Journal
Disseminator of Knowledge
Home Home | About Us About Us | Contact Us Contact Us | Login Monday, March 30, 2020
Title: Algorithm OptPathTrans Optimized for Use with Location Update Vectors and its Comparison to Minimum Hop Routing in Mobile Ad hoc Networks
Authors: Mr. Alexander Roy Geoghegan, Dr. Natarajan Meghanathan
In an earlier work, we proposed the OptPathTrans algorithm to minimize the number of path transitions during a source-destination (s-d) session in a mobile ad hoc network. The sequence of longest-living stable paths determined over the duration of the s-d session is called the Stable Mobile Path (SMP). But, the average hop count per static path for SMP is significantly larger than the minimum required hop count for a path between the source and destination. Also, algorithm OptPathTrans requires complete knowledge about future topology changes over the duration of the s-d session. In this paper, we illustrate the effectiveness of predicting the future topology changes using the location and mobility information of the nodes in the form of Location Update Vectors (LUVs) learnt at the time of determining a static stable path of the SMP. The modified algorithm is referred to as OptPathTrans-LUV and the sequence of predicted static stable paths (that also actually exists) is referred to as SMP-LUV. Simulation results illustrate that the average lifetime per static path of SMP-LUV can be as large as 88% of the lifetime per static path obtained for SMP. On the other hand, the average hop count per static path of SMP-LUV can be as low as 80% of the hop count per static path for SMP.