A probabilistic protocol for multihop routing in VANETs

Vehicular ad hoc networks (vanets) allow communications over sequences of vehicles with radio devices. there are many possible applications over a vanet such as traffic jam warning,collision warning,parking lot reservations,camera picture feed,and so forth. there have been quite a few results in the area seeking for a fast and reliable communication protocol due to their potential. vanets,however,are pointed out as difficult for numerical optimizations due to frequent changes in their topologies. as a result,heuristic methods such as gpsr have been mainly used for routing packets over multihop communications. in this paper,we present an algorithm to precompute the probability that communication is possible between specified source and destination in a vanet,under certain mathematical assumption. the proposed new protocol for multihop communication refers to a lookup table containing the precomputed data to decide a good packet forwarder quickly. we create a simulation testbed that seems challenging for all the existing multihop routing protocols for vanets,in which we test ours. we see much improved performances over gpsr after the algorithm is refined for some practical issues. © 2010 junichiro fukuyama.