Junction-Based Geographic Routing Algorithm for Vehicular Ad hoc Networks

Authors:
Sotirios Tsiachris;Georgios Koltsidas;Fotini-Niovi Pavlidou
Affiliations:
Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Thessaloniki, Greece 54124;Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Thessaloniki, Greece 54124;Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Thessaloniki, Greece 54124
Venue:
Wireless Personal Communications: An International Journal
Year:
2013

Citing 8
Cited 0

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
MDDV: a mobility-centric data dissemination algorithm for vehicular networks

Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Geographic routing in city scenarios

ACM SIGMOBILE Mobile Computing and Communications Review
VanetMobiSim: generating realistic mobility patterns for VANETs

Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Predictive Directional Greedy Routing in Vehicular Ad hoc Networks

ICDCSW '07 Proceedings of the 27th International Conference on Distributed Computing Systems Workshops
Vehicle Ad Hoc networks: applications and related technical issues

IEEE Communications Surveys & Tutorials

Quantified Score

Hi-index	0.00

Visualization

Abstract

Vehicular Ad hoc Networks have attracted the interest of the scientific community, since many issues remain open, especially in the research area of routing techniques. In this work we propose a new position-based routing algorithm called Junction-Based Routing. The algorithm makes use of selective greedy forwarding up to the node that is located at a junction and is closer to the destination. If a local optimum is reached, a recovery strategy is applied, the key point of which is our proposed minimum angle method. We evaluate the performance of our routing protocol in real city topology. The simulated scenarios use obstacle modelling and several different Physical layer settings. Simulation results show that our proposal achieves superior performance compared to the well-known Greedy Perimeter Coordinator Routing algorithm.