A Hybrid Routing Approach for Vehicular Delay Tolerant Network

摘要

This paper presents a novel approach for routing algorithm suitable for vehicular delay tolerant networks. Present approach abstracts the properties of two very popular routing algorithms Spray & Wait and Maxprop giving a new algorithm to improve the performance. Proposed algorithm is implemented in java and simulated on opportunistic network environment simulator. Performance of proposed algorithm is compared with algorithms used in delay tolerant networks on parameters like number of bundles dropped, delivery probability and overhead ratio. Results of the simulation indicate better performance of the proposed algorithm compared with earlier algorithms (e.g. MaxProp, Spray and Wait, ProPHET) on many parameters.