GrooveSim: a topography-accurate simulator for geographic routing in vehicular networks

  • Authors:

  • Rahul Mangharam;Daniel S. Weller;Daniel D. Stancil;Ragunathan Rajkumar;Jayendra S. Parikh

  • Affiliations:

  • Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA;General Motors Corporation, Warren, MI

  • Venue:
  • Proceedings of the 2nd ACM international workshop on Vehicular ad hoc networks
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Vehicles equipped with wireless communication devices are poised to deliver vital services in the form of safety alerts, traffic congestion probing and on-road commercial applications. Tools to evaluate the performance of vehicular networks are a fundamental necessity. While several traffic simulators have been developed under the Intelligent Transport System initiative, their primary focus has been on modeling and forecasting vehicle traffic flow and congestion from a queuing perspective. In order to analyze the performance and scalability of inter-vehicular communication protocols, it is important to use realistic traffic density, speed, trip, and communication models. Studies on multi-hop mobile wireless routing protocols have shown the performance varies greatly depending on the simulation models employed. We introduce GrooveSim, a simulator for geographic routing in vehicular networks to address the need for a robust, easy-to-use realistic network and traffic simulator. GrooveSim accurately models inter-vehicular communication within a real street map-based topography. It operates in five modes capable of actual on-road inter-vehicle communication, simulation of traffic networks with thousands of vehicles, visual playback of driving logs, hybrid simulation composed of real and simulated vehicles and easy test-scenario generation. Our performance results, supported by field tests, establish geographic broadcast routing as an effective means to deliver time-bounded messages over multiple-hops.