Paper Info
Title
Heuristic Methods in Geographical Routing Protocols for VANETs
Abstract
This paper proposes different local\\hyph search heuristics to improve the performance of geographical routing protocols in VANET networks, which typically relies the selection of the next node only on the best candidate. The presented algorithms are based on modifications of well-known metaheuristics such as simulated annealing, metropolis and tabu. We divided our heuristics according to their operation in forwarding and recovery algorithms. However, a simultaneous use of some of them is also possible to improve the overall performance of the system. Simulation results of the proposed implementation of tabu-search in our routing proposal show a promising increment in the packet delivery ratio.
Year
DOI
Venue
2015
10.1145/2810379.2810394
PE-WASUN@MSWiM
Field
DocType
Citations 
Simulated annealing,Equal-cost multi-path routing,Link-state routing protocol,Dynamic Source Routing,Computer science,Computer network,Heuristics,Tabu search,Metaheuristic,Routing protocol,Distributed computing
Conference
0
PageRank 
References 
Authors
0.34
6
4
Name
Order
Citations
PageRank
Luis Urquiza Aguiar1367.67
Daniel Almeida210.71
Carolina Tripp Barba38611.23
Mónica Aguilar-igartua43910.59