1 / 12

Enhancing Urban Vehicle Routing Algorithms for Optimal Performance

Explore Map-based Routing in Large-Scale Urban Vehicle Networks, introducing Algorithm Enhancements and revealing inefficiencies in current methods. Focus on Minimum Delay Algorithm and Vehicular-to-Vehicular transmissions. Discuss factors impacting routing efficiency and the importance of predictive node behavior. Evaluate joint probabilistic patterns and optimal routing path properties for improved urban mobility.

haamid
Télécharger la présentation

Enhancing Urban Vehicle Routing Algorithms for Optimal Performance

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Map based routing in large scale urban vehicle networks

  2. agenda

  3. Optimal Routing algorithm • Minimum Delay Algorithm (MDA) • Minimum Delay and Hops Algorithm (MDHA) • Vehicular to Vehicular, Vehicular to Location, Location to Location

  4. Inefficiency of existing algorithms revealed • Geo routing family: • Performance degrades quickly as transmission distance increases • Local maximum is extremely hard to detect • Mobility based routing family • Is the behavior of individual node really RELAIBALY predictable? • Choice of the length of time frame used in statistical pattern mining • Let’s consider the JOINT probability

  5. An example

  6. Properties of optimal routing path • Relative spatial stability • Relative temporal stability • Routing sequence is very dynamic

  7. Map based routing • Switch the respective

  8. Model for a road section • Modeled as a bi-directed link • The weight of a link reflects the average packet travel time over that link

  9. Algorithm Enhancement

  10. Performance • Comm radius 100m, transmission distance 6KM

  11. Factor－comm range

  12. Factor－comm range

More Related