Abstract
With the development of vehicle networks, the information transmission between vehicles is becoming increasingly important. Many applications, particularly regarding security, are based on communication between vehicles. These applications have strict requirements for factors such as the quality of communication between vehicles and the time delay. Many theoretical communication protocols ignore the presence of buildings or other obstacles that are present during practical use, especially in urban areas. These obstacles can cause a signal to fade or even block direct communication. Many vehicles are often parked at the roadside. Because of their location, these parked vehicles can be used as relays to effectively reduce the shadowing effect caused by obstacles and even solve communication problems. In this paper, we study the problem of parked-vehicle-assistant relay routing communication in vehicle ad hoc networks. We propose an efficient parked vehicle assistant relay routing algorithm that is composed of four parts: a periodic Hello packet exchange mechanism, candidate relay list update, communication link quality evaluation, and candidate relay list selection. Simulation results reveal obvious advantages for indexes such as the quality of communication, success rate, and time delay.
I. INTRODUCTION
WITH the widespread rise of the Internet of Things (IoT), vehicular ad hoc networks (VANET) have undergone rapid development, and they are beginning to improve the driving experience. The most obvious benefit is improved vehicle safety. In a VANET, a driver can obtain real-time information and anticipate traffic problems, which can greatly reduce the occurrence of traffic accidents. The VANET is created through information interactions between vehicles.
VI. CONCLUSION AND FUTURE WORK
There are many buildings and other obstructions in cities or suburban areas. These features cause poor or even interrupted communication in VANETs. In this article, we propose using vehicles parked on the roadside or near buildings as relays and design related broadcasting algorithms. The algorithm has three components: a packet updating algorithm, a link quality evaluation algorithm and a relay node selection algorithm. The above algorithms consider the advantages of unused parked vehicles and link quality. Based on this algorithm, moving vehicles and parked vehicles can work together to effectively avoid a broadcast storm, increase the utilization rate of resources, and effectively relieve pressure on the network. The simulation results show that the parked vehicle algorithm has obvious advantages in terms of time delay, link quality, information achievable ratio and the number of hops.
