Abstract

Recently, with the different issues encountered in road mobility, the presence and development of the Vehicular Ad hoc Networks (VANETs) have become a necessity. VANETs have various positive impacts on vehicular safety, road security, traffic management, drivers' comfort, and passengers' convenience. However, the expansion in the world's population has led to enormous traffic congestion on multiple roads. This congestion results in uncontrollable delays affecting economics, society and the environment. In this paper, we propose two routing protocols that depend on the Signal to Interference Ratio (SIR), differing from existing ones by introducing a new metric to select the best route from a source to a destination. In the first protocol, we choose the best route based on the maximum level of SIR at each node. Besides, we select the Backup SIR to minimize the number of SIR calculations at the channel update process. While in the second protocol, we design a hybrid Markov chain model composed of two Markov models; the first one aims at predicting the SIR value of the next round, while the second one is an analytical model that targets managing the number of channel update process. In order to validate our solution, extensive simulations are realized in considering the real scenario of the city of Beirut (Lebanon). The results show that our proposed protocols perform better with regard to overhead, packet delivery ratio, throughput and end‐to‐end delay.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.