Loading...

A new routing algorithm for sparse vehicular AD HOC networks with moving destinations

Ghaffari, M ; Sharif University of Technology | 2009

271 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/WCNC.2009.4917517
  3. Publisher: 2009
  4. Abstract:
  5. In this paper, we propose the Object Pursuing based Efficient Routing Algorithm (OPERA) suitable for vehicular ad hoc networks (VANETs), esp. in sparse situations. The proposed algorithm is applicable for both moving and fixed destinations. It is based on considering static nodes at each intersection. In this algorithm, we optimize the decision making at intersections, with respect to the connectivity and feasibilty of the roads. To this end, we consider the average delay of each road as the connectivity metric, and the vehicle availability in the transmission range of the intersection as the feasibility metric. By exploiting the related metrics, we select the next road to forward the packet in order to minimize the overall delay. We also include a pursuing phase in our algorithm, in order to capture the moving destinations. The simulation results indicate the superiority of our proposed algorithm, compared to previous ones. © 2009 IEEE
  6. Keywords:
  7. Ad hoc ; Average delay ; Efficient routing ; Simulation result ; Transmission ranges ; Vehicular ad hoc networks ; Vehicular network ; Intersections ; Mobile telecommunication systems ; Real time systems ; Routing algorithms ; Wireless telecommunication systems ; Ad hoc networks
  8. Source: 2009 IEEE Wireless Communications and Networking Conference, WCNC 2009, Budapest, 5 April 2009 through 8 April 2009 ; 2009 ; 15253511 (ISSN); 9781424429486 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4917517