A Reliable Routing Scheme Based on Vehicle Moving Similarity for VANETs

Abstract

In this paper, we propose a reliable routing scheme based on vehicle moving similarity (RR-VMS), which focuses on stable rebroadcast nodes selection and route discovery to make inter-vehicle data transmissions more reliable. We select nearby vehicles having similar velocities with the source vehicle as rebroadcast nodes. We call these vehicles having moving similarity with the source vehicle. To reflect vehicle moving similarity, a vehicle persistence score (VPS) is derived. A vehicle with a high VPS, chosen as a rebroadcast node, will stay long enough in an inter-vehicle transmission path. Moreover, to reduce the number of rebroadcast nodes, we define a donut-like selection area to choose relay nodes in order to reduce the route hop count and network traffic. Simulation results show that in large speed range scenarios, the proposed RR-VMS increases (reduces) 8.3% (16%) and 8.3% (15%) of the delivery ratio (number of broken links) compared to AODV and PAODV, respectively. In addition, RR-VMS also reduces 30% and 13% routing overhead compared to AODV and PAODV respectively. The proposed method is simple and feasible to other ad hoc routing protocols as well that involve broadcast.