GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
CarNet: a scalable ad hoc wireless network system
EW 9 Proceedings of the 9th workshop on ACM SIGOPS European workshop: beyond the PC: new challenges for the operating system
ANSS '06 Proceedings of the 39th annual Symposium on Simulation
Predictive Directional Greedy Routing in Vehicular Ad hoc Networks
ICDCSW '07 Proceedings of the 27th International Conference on Distributed Computing Systems Workshops
Highly dynamic and scalable VANET routing for avoiding traffic congestions
Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks
Reliable and Efficient Alarm Message Routing in VANET
ICDCSW '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops
Routing and Address Assignment Using Lane/Position Information in a Vehicular Ad Hoc Network
APSCC '08 Proceedings of the 2008 IEEE Asia-Pacific Services Computing Conference
Enhancing AODV routing protocol using mobility parameters in VANET
AICCSA '08 Proceedings of the 2008 IEEE/ACS International Conference on Computer Systems and Applications
Vehicle-to-vehicle wireless communication protocols for enhancing highway traffic safety
IEEE Communications Magazine
| Hi-index | 0.00 |
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.