Connectivity Aware Routing in Vehicular Networks

Abstract

Multi-hop car to car communications are useful for supporting many vehicular applications that provide drivers with safety and convenience ranging from office on the wheel to real traffic query, vehicle safety, parking space searching and on-road advertisement. Developing multi-hop communication in vehicular ad hoc networks (VANET) is a challenging problem due to the rapidly changing topology and frequent network disconnections, which cause failure or inefficiency in traditional ad hoc routing protocols. The problem of frequent network disconnections can be partially addressed using a carry-andforward mechanism which may incur higher delay. However, our connectivity aware routing (CAR) protocol addresses this problem by selecting an optimal route with the least probability of network disconnection and avoids carry-and-forward delay. This can be achieved using our new probabilistic model of network connectivity which takes into account a more realistic clustering phenomenon of vehicle traffic in city scenarios that is caused by traffic lights. Our simulation results show that the proposed CAR protocol outperforms existing VANET routing protocols in terms of data delivery ratio, data packet delay and network throughput. In addition, CAR improves performance for both sparse and dense networks.

GPSR-TARS: Congestion aware geographically targeted remote surveillance for VANETs

“…We will therefore investigate proposals such as [22] to enable the system to be more resource considerate and disconnection tolerant. Our TARS module is to be enhanced with features of other position based routing protocols to improve on performance over distance; in particular Connectivity Aware Routing (CAR) [23] will be looked at as the route preserving guard nodes could improve on the overall delivery ratio. Support will also be added for the moving and merging of live clusters.…”

An Adaptive Routing Protocol Based on QoS and Vehicular Density in Urban VANETs

“…One of the simple but efficient methods to improve the path stability is to find the next hop with the longest link duration (or the most stable connectivity) [11][12][13][14][15]. A Receive On Most Stable Group-Path (ROMSGP) scheme [11] has been designed to choose the most stable path with the longest link expiration time.…”

“…Next each neighbor answers to the beacon with the information of its own position and velocity. Based on the neighbors' information of positions and velocities, node can compute CDP value of each neighbor by (7) or (13). Thus the neighbor table and neighbor list of node are updated.…”

Routing in Vehicular Ad Hoc Networks: towards Road-Connectivity Based Routing

“…Based on this observation, new approaches propose to investigate more the use of real traffic information. Yang et al propose Connectivity Aware Routing protocol (Yang et al, 2008) which uses the statistical data collected by different vehicles to estimate the probability of connectivity of each road segment. In their model, the authors consider also the clustering phenomenon resulting from vehicles movement affected by the traffic light.…”