Bus-Trajectory-Based Street-Centric Routing for Message Delivery in Urban Vehicular Ad Hoc Networks

Abstract

© 1967-2012 IEEE. This paper focuses on the routing algorithm for the communications between vehicles and places in urban vehicular ad hoc networks. As one of the basic transportation facilities in an urban setting, buses periodically run along their fixed routes and cover many city streets. The trajectory of bus lines can be seen as a submap of a city. Based on the characters of bus networks, we propose a bus-trajectory-based street-centric (BTSC) routing algorithm, which uses buses as the main relay to deliver messages. In BTSC, we build a routing graph based on the trajectories of bus lines by analyzing the probability of bus appearing on every street. We propose two novel concepts, i.e., the probability of street consistency and the probability of path consistency, which are used as metrics to determine routing paths for message delivery. This aims to choose the best path with higher density of busses and lower probability of transmission direction deviating from the routing path. In order to improve the bus forwarding opportunity, we design a bus-based forwarding strategy with ant colony optimization to find a reliable and a steady multihop link between two relay buses in order to decrease the end-to-end delay. The BTSC makes improvements in the selection of routing paths and a strategy of message forwarding. Simulation results show that our proposed routing algorithm has a better performance in terms of the transmission ratio, transmission delay, and adaptability to different networks.