Abstract

The emergence of smart cities and the need to use intelligent transportation systems has led to an increased reliance on vehicle ad hoc networks (VANET). The topology of VANET is highly dynamic, which results in a short effective routing time. This paper presents a two-stage algorithm to select a route that can sustain communication between vehicles for as long as possible while taking into account the variables that affect the VANET topology. The first stage uses Skellam distribution model to assess the connectivity probability of paths in ?a 2d road network based on traffic-flow and the number of vehicles ?joining and leaving the ?network, accordingly, the path with the highest connectivity is chosen. In the second stage, the control packets sent only to vehicles on the selected path to detect routes between source and destination, thus reducing the overhead of control packets and increasing network stability. ? the algorithm adopts the principle of global evaluation to ?estimate the lifetime ?of the ?detected ?routes within the chosen path. ?the route with the ?best estimated ?lifetime ?is ?chosen to be ?the active route. ?in the event of route failure, the validity of the next route in lifetime is confirmed to be adopted as the alternate route. The proposed algorithm was compared with both on-?demand distance ?vector routing protocol (AODV) protocol and the modified location-aided routing ??(LAR) ?protocol. The proposed algorithm showed greater network stability, higher performance in terms of longer lifetime route detection, less energy consumption and higher throughput.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.