Path Selection Algorithms for Multi-Hop VANETs

In this paper, we introduce a collision model for vehicular cluster and we propose path selection algorithms for multi-hop VANETs. That is, we propose the intuitive algorithm named range-aware broadcasting (RAB), the collisions minimized optimal path selection algorithm (CM-Opt), SNR-guaranteed optimal path selection algorithm (SNRG-Opt), low-complexity SNR-guaranteed path selection algorithm (Low-SNRG), and distributed algorithms to reduce the number of collisions and/or reduce the complexity. We show that Low-SNRG has same performance as SNRG-Opt. Through computer simulations, it is shown that the proposed algorithms reduce the number of collision significantly. Also, it is shown that Low-SNRG has almost same average number of collisions as CM-Opt in spite of its low complexity. Also, the distributed path selection algorithm has similar performance to the non-distributed algorithms.