Welcome to the InfoSci Platform
Reference Hub1
A Probabilistic Routing Protocol in VANET

A Probabilistic Routing Protocol in VANET

Gongjun Yan, Stephan Olariu, Shaharuddin Salleh
Copyright: © 2010 |Volume: 2 |Issue: 4 |Pages: 17
ISSN: 1937-9412|EISSN: 1937-9404|EISBN13: 9781613502617|DOI: 10.4018/jmcmc.2010100102
Cite Article Cite Article

MLA

Yan, Gongjun, et al. "A Probabilistic Routing Protocol in VANET." IJMCMC vol.2, no.4 2010: pp.21-37. http://doi.org/10.4018/jmcmc.2010100102

APA

Yan, G., Olariu, S., & Salleh, S. (2010). A Probabilistic Routing Protocol in VANET. International Journal of Mobile Computing and Multimedia Communications (IJMCMC), 2(4), 21-37. http://doi.org/10.4018/jmcmc.2010100102

Chicago

Yan, Gongjun, Stephan Olariu, and Shaharuddin Salleh. "A Probabilistic Routing Protocol in VANET," International Journal of Mobile Computing and Multimedia Communications (IJMCMC) 2, no.4: 21-37. http://doi.org/10.4018/jmcmc.2010100102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.