A new routing algorithm for sparse vehicular ad-hoc networks with moving destinations

Authors:
Mohsen Ghaffari;Farid Ashtiani
Affiliations:
Department of Electrical Engineering, Advanced Communications Research Institute, Sharif University of Technology;Department of Electrical Engineering, Advanced Communications Research Institute, Sharif University of Technology
Venue:
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Year:
2009

Citing 3
Cited 1

Urban multi-hop broadcast protocol for inter-vehicle communication systems

Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
A static-node assisted adaptive routing protocol in vehicular networks

Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks
A modified 802.11-based MAC scheme to assure fair access for vehicle-to-roadside communications

Computer Communications

Connectivity-aware minimum-delay geographic routing with vehicle tracking in VANETs

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose the Object Pursuing based Efficient Routing Algorithm (OPERA) suitable for vehicular ad hoc networks (VANETs), esp. in sparse situations. The proposed algorithm is applicable for both moving and fixed destinations. It is based on considering static nodes at each intersection. In this algorithm, we optimize the decision making at intersections, with respect to the connectivity and feasibilty of the roads. To this end, we consider the average delay of each road as the connectivity metric, and the vehicle availability in the transmission range of the intersection as the feasibility metric. By exploiting the related metrics, we select the next road to forward the packet in order to minimize the overall delay. We also include a pursuing phase in our algorithm, in order to capture the moving destinations. The simulation results indicate the superiority of our proposed algorithm, compared to previous ones.