A Probabilistic Routing Protocol in VANET

A Probabilistic Routing Protocol in VANET

Gongjun Yan (Indiana University Kokomo, USA), Stephan Olariu (Old Dominion University, USA) and Shaharuddin Salleh (Universiti Teknologi Malaysia, Malaysia)
DOI: 10.4018/978-1-4666-0119-2.ch002
OnDemand PDF Download:
No Current Special Offers


The key attribute that distinguishes Vehicular Ad hoc Networks (VANET) from Mobile Ad hoc Networks (MANET) is scale. While MANET networks involve up to one hundred nodes and are short lived, being deployed in support of special-purpose operations, VANET networks involve millions of vehicles on thousands of kilometers of highways and city streets. Being mission-driven, MANET mobility is inherently limited by the application at hand. In most MANET applications, mobility occurs at low speed. By contrast, VANET networks involve vehicles that move at high speed, often well beyond what is reasonable or legally stipulated. Given the scale of its mobility and number of actors involved, the topology of VANET is changing constantly and, as a result, both individual links and routing paths are inherently unstable. Motivated by this latter truism, the authors propose a probability model for link duration based on realistic vehicular dynamics and radio propagation assumptions. The paper illustrates how the proposed model can be incorporated in a routing protocol, which results in paths that are easier to construct and maintain. Extensive simulation results confirm that this probabilistic routing protocol results in more easily maintainable paths.
Chapter Preview

Based on the attributes (probability, mobility, position, neighbors), we can classify the existing VANET routing protocols into four categories: probability, mobility, position, and flooding based routing. There is some infrastructure based routing, but we are interested in the non-infrastructure network, i.e., the adhoc network.

Complete Chapter List

Search this Book: