In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route for the transmission of the packets of data in the direction of their destination by taking into consideration the status of the traffic segment when selecting the next intersection. Through this algorithm, a new formula for assessing the status of the segment is presented based on three elements: density, connectivity, and distance. To evaluate this routing algorithm, simulations are performed, once the results are obtained, they are compared with the existing routing algorithms. The evaluation of results offered evidence that our routing algorithm did well in terms of packet delivery ratio and packet delivery delay.
