120 likes | 210 Vues
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.
E N D
Optimal Routing algorithm • Minimum Delay Algorithm (MDA) • Minimum Delay and Hops Algorithm (MDHA) • Vehicular to Vehicular, Vehicular to Location, Location to Location
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
Properties of optimal routing path • Relative spatial stability • Relative temporal stability • Routing sequence is very dynamic
Map based routing • Switch the respective
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
Performance • Comm radius 100m, transmission distance 6KM