Data dissemination for delay tolerant vehicular networks: using historical mobility patterns

  • Authors:

  • Seyedali Hosseininezhad;Victor C.M. Leung

  • Affiliations:

  • The University of British Columbia, Vancouver, British Columbia, Canada;The University of British Columbia, Vancouver, British Columbia, Canada

  • Venue:
  • Proceedings of the third ACM international symposium on Design and analysis of intelligent vehicular networks and applications
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a message dissemination algorithm for location-aware services in vehicular networks. The objective is to reduce information delivery time in intermittently connected urban vehicular networks by using historical mobility information of vehicles. Roads are divided based on observed traffic density into dense and sparse paths and vehicles share their current knowledge about fastest possible message delivery time to contouring dense roads. We use a Dijkstra based shortest path calculation with link weights set to packet dissemination time based on observed traffic and available relays in the vicinity. To simplify the shortest path calculation we calculate delay under two strategies. The first strategy is to relay information to closest dense road and use relaying. The second strategy is to try carry and forward towards the destination. Historical mobility information is used to find the best carrier candidate. On dense roads, information will be broadcast towards the destination without the carrying phase, while on sparse roads knowledge about the historical mobility patterns improves the next relay selection efficiency. Using simulations we show the superiority of our proposed method in delay and reliability of packet delivery compared to conventional data dissemination methods such as VADD in city traffic scenarios.