Efficient algorithms for urban vehicular Ad Hoc networks quality based on average network flows

Vehicular ad hoc networks (VANETs) have received much attention from various parties in recent years. With the continuous development of VANETs and the generation of VANET applications, the study of network quality for VANETs becomes quite essential. In this paper, we use Average Network Flow (ANF) as a measure of the overall network quality of the city, and propose a tree-cut mapping-based average maximum flow solution method (TCMANF). TCMANF can quickly obtain the maximum flow of the network between the nodes and thus to determine the average network flow, which is better than the traditional maximum flow computation method in terms of time and the accuracy can be up to 99%, and it is suitable for the computation of urban vehicular networking networks. The article compares this with the use of an overall network capacity metric for urban vehicular networks approach and concludes that ANF can better reflect the impact of the discrete degree of vehicle topology on the overall network quality.