SROR: A Secure and Reliable Opportunistic Routing for VANETs

Abstract

In Vehicular Ad Hoc Networks (VANETs), high mobility of vehicles issues a huge challenge to the reliability and security of transmitting packets. Therefore, a Secure and Reliable Opportunistic Routing (SROR) is proposed in this paper. During construction of Candidate Forwarding Nodes (CFNs) set, the relative velocity, connectivity probability, and packet forwarding ratio are taken into consideration. The aim of SROR is to maximally improve the packet delivery ratio as well as reduce the end-to-end delay. The selection of a relay node from CFNs is formalized as a Markov Decision Process (MDP) optimization. The SROR algorithm extracts useful knowledge from historical behavior of nodes by interacting with the environment. This useful knowledge are utilized to select the relay node as well as to prevent the malicious nodes from forwarding packets. In addition, the influence of different learning rate and exploratory factor policy on rewards of agents are analyzed. The experimental results show that the performance of SROR outperforms the benchmarks in terms of the packet delivery ratio, end-to-end delay, and attack success ratio. As vehicle density ranges from 10 to 50 and percentage of malicious vehicles is fixed at 10%, the average of packet delivery ratio, end-to-end delay, and attack success ratio are 0.82, 0.26s, and 0.37, respectively, outperforming benchmark protocols.