A Geographical Heuristic Routing Protocol for VANETs

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 tr...

Full description

Bibliographic Details
Main Authors: Luis Urquiza-Aguiar, Carolina Tripp-Barba, Mónica Aguilar Igartua
Format: Article
Language:English
Published: MDPI AG 2016-09-01
Series:Sensors
Subjects:
Online Access:http://www.mdpi.com/1424-8220/16/10/1567
_version_ 1797999416070635520
author Luis Urquiza-Aguiar
Carolina Tripp-Barba
Mónica Aguilar Igartua
author_facet Luis Urquiza-Aguiar
Carolina Tripp-Barba
Mónica Aguilar Igartua
author_sort Luis Urquiza-Aguiar
collection DOAJ
description 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).
first_indexed 2024-04-11T11:04:12Z
format Article
id doaj.art-7d9a8f2cb25847fabb439cf8821f2dc4
institution Directory Open Access Journal
issn 1424-8220
language English
last_indexed 2024-04-11T11:04:12Z
publishDate 2016-09-01
publisher MDPI AG
record_format Article
series Sensors
spelling doaj.art-7d9a8f2cb25847fabb439cf8821f2dc42022-12-22T04:28:25ZengMDPI AGSensors1424-82202016-09-011610156710.3390/s16101567s16101567A Geographical Heuristic Routing Protocol for VANETsLuis Urquiza-Aguiar0Carolina Tripp-Barba1Mónica Aguilar Igartua2Department of Network Engineering, Universitat Politècnica de Catalunya (UPC), C. Jordi Girona 1-3, Barcelona 08034, SpainFaculty of Informatics, Universidad Autónoma de Sinaloa (UAS), De los Deportes Avenue and Leonismo Internacional, Mazatlán 82107, MexicoDepartment of Network Engineering, Universitat Politècnica de Catalunya (UPC), C. Jordi Girona 1-3, Barcelona 08034, SpainVehicular 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).http://www.mdpi.com/1424-8220/16/10/1567heuristic optimizationrouting protocolsVANET
spellingShingle Luis Urquiza-Aguiar
Carolina Tripp-Barba
Mónica Aguilar Igartua
A Geographical Heuristic Routing Protocol for VANETs
Sensors
heuristic optimization
routing protocols
VANET
title A Geographical Heuristic Routing Protocol for VANETs
title_full A Geographical Heuristic Routing Protocol for VANETs
title_fullStr A Geographical Heuristic Routing Protocol for VANETs
title_full_unstemmed A Geographical Heuristic Routing Protocol for VANETs
title_short A Geographical Heuristic Routing Protocol for VANETs
title_sort geographical heuristic routing protocol for vanets
topic heuristic optimization
routing protocols
VANET
url http://www.mdpi.com/1424-8220/16/10/1567
work_keys_str_mv AT luisurquizaaguiar ageographicalheuristicroutingprotocolforvanets
AT carolinatrippbarba ageographicalheuristicroutingprotocolforvanets
AT monicaaguilarigartua ageographicalheuristicroutingprotocolforvanets
AT luisurquizaaguiar geographicalheuristicroutingprotocolforvanets
AT carolinatrippbarba geographicalheuristicroutingprotocolforvanets
AT monicaaguilarigartua geographicalheuristicroutingprotocolforvanets