A Vehicular Communication Routing Algorithm Based on Graph Theory

Recently, the vehicular ad hoc network (VANET) has attracted the attention of researchers with the development of the internet of things (IoT) and the intelligent transport system (ITS). One of the major application scenarios of the fifth generation wireless communication is massive machine type communication (mMTC). In order to aggregate the data recorded by machines, information packets need to be delivered to bureaus in the network. However, some packets are not very urgent and they don't have to be transferred by the cellular communication due to the fact that the spectrum source is scarce. With the increasing number of vehicles and the increasing computing power of on board units (OBUs), vehicle-to-vehicle (V2V) communications are better to deliver data packets. In order to transfer the packets effectively, it is important to find a reliable vehicular communication route. As the topology and the vehicles velocity change much more rapidly, the existing routing algorithms in other kinds of ad hoc networks are not suitable for the VANET. In this paper, we propose a vehicular routing algorithm based on graph theory. We consider the network situations more comprehensively and the simulation results show that the algorithm proposed is superior to the traditional routing algorithm.