AdHocVDew: Graph Theory Based Dew Enabled 5G Vehicular Ad Hoc Network

In this article, a vehicular ad hoc network (VANET) based on dew computing and graph theory is proposed. A major challenge in vehicular networks is to accurately and quickly process the data generated by the growing number of vehicles. Vehicle to vehicle direct communication is a very significant solution to reduce delay and power consumption. The use of cloud computing and fog computing in the field of vehicular networks is significant, but the location of the computing device relatively far from the data source increases the amount of delay and power consumption of the network. dew computing is able to solve these problems. In AdHocVDew, I have proposed a VANET based on dew computing. The connection process between vehicles and dews is discussed through graph theory. Here weighted directed graph is used. It has a weight value and a direction for each edge between a vertex and another vertex. Two algorithms are proposed in this article. The first algorithm combines a number of dews based on distance to form a cluster, and the dews located within the cluster attempt to complete the generated task. With the second algorithm, the task is directly transferred from one vehicle to another vehicle through intermediate dews based on the shortest path. In AdHocVDew, the delay and power consumption of the proposed network are calculated and compared with previously published articles. The proposed network generates 39% and 73% less delay and power consumption compared to the existing networks, respectively.