VAST: Volume adaptive searching technique for optimized routing in mobile ad-hoc networks

In this paper we propose a searching technique termed as VAST to determine an optimal path from source node to destination node in densely deployed mobile ad-hoc network. We have compared the proposed VAST algorithm with metaheuristic algorithms GRASP, Semi-greedy and Tabu search, in terms of the routing cost and algorithm execution time. The comparison results shows that the proposed VAST algorithm outperforms the other algorithm and that it is suitable for adapting the routing optimization problem.