B-VAST: Buffer-volume adaptive searching technique for optimized routing in opportunistic networks

Routing in wireless network is a challenging issue. In this paper, we have proposed B-VAST searching technique which is an improvement to VAST(Volume Adaptive Searching Technique) to determine optimized route from source node to destination node in densely deployed network. We have compared simulation outcomes of VAST and B-VAST both in terms of computation time and cost in determining shortest path. Comparison results shows that B-VAST takes very less computation time than VAST if the mobility in network is limited.