Next Article in Journal
A Wireless and Batteryless Intelligent Carbon Monoxide Sensor
Next Article in Special Issue
QUEST: Eliminating Online Supervised Learning for Efficient Classification Algorithms
Previous Article in Journal
Secure Nearest Neighbor Query on Crowd-Sensing Data
Previous Article in Special Issue
Using Crowdsourced Trajectories for Automated OSM Data Entry Approach
Article Menu

Export Article

Open AccessArticle
Sensors 2016, 16(10), 1567;

A Geographical Heuristic Routing Protocol for VANETs

Department of Network Engineering, Universitat Politècnica de Catalunya (UPC), C. Jordi Girona 1-3, Barcelona 08034, Spain
Departamento de Electrónica, Telecomunicaciones y Redes de Información, Facultad de Eléctrica y Electrónica, Escuela Politécnica Nacional (EPN), C. Ladrón de Guevara E11-253, Quito P.O.Box 17-01-2759, Ecuador
Faculty of Informatics, Universidad Autónoma de Sinaloa (UAS), De los Deportes Avenue and Leonismo Internacional, Mazatlán 82107, Mexico
Author to whom correspondence should be addressed.
Academic Editor: Yu Wang
Received: 9 June 2016 / Revised: 14 September 2016 / Accepted: 18 September 2016 / Published: 23 September 2016
Full-Text   |   PDF [3163 KB, uploaded 23 September 2016]   |  


Vehicular ad hoc networks (VANETs) leverage the communication system of Intelligent Transportation Systems (ITS). Recently, Delay-Tolerant Network (DTN) routing protocols have increased their popularity among the research community for being used in non-safety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a local-search. In this paper, we propose a generic Geographical Heuristic Routing (GHR) protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabu-search meta-heuristics, which have largely been used to improve local-search results in discrete optimization. We include a complete performance evaluation of GHR in a multi-hop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation). View Full-Text
Keywords: heuristic optimization; routing protocols; VANET heuristic optimization; routing protocols; VANET

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Urquiza-Aguiar, L.; Tripp-Barba, C.; Aguilar Igartua, M. A Geographical Heuristic Routing Protocol for VANETs. Sensors 2016, 16, 1567.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top