Congestion-Aware Routing (CAR):Vehicular Traffic Routing Based on Real-Time Road Occupancy Estimates

  • Wilson M
  • Boateng K
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

This work addresses the problem of routing vehicular traffic on road networks. Fair routing is effected using real-time data acquired from a sensor network superimposed on road networks. Routing information is in the form of which route provides the fastest set of interlinked road segments between any departure-destination pair of nodes. The work adopts Dijkstra's Shortest Path First (SPF) routing algorithm and derives a suitable routing metric from road occupancy data as a major contribution of this work that makes the SPF algorithm applicable to vehicular traffic routing on road networks. Also, a hypothetical road network and a corresponding Mobile App is used to illustrate our novel vehicular traffic routing algorithm. It is shown in this work that the method is more practical and easier to realize than a method in literature - Spatial and Traffic Aware Vehicular Routing (STAR). [ABSTRACT FROM AUTHOR]

Cite

CITATION STYLE

APA

Wilson, M., & Boateng, K. O. (2018). Congestion-Aware Routing (CAR):Vehicular Traffic Routing Based on Real-Time Road Occupancy Estimates. Ghana Journal of Science, 59(0), 5. https://doi.org/10.4314/gjs.v59i1.1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free