Heuristic methods in geographical routing protocols for VANETs
Document typeConference report
PublisherAssociation for Computing Machinery (ACM)
Rights accessRestricted access - publisher's policy
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.
CitationUrquiza, L. [et al.]. Heuristic methods in geographical routing protocols for VANETs. A: ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks. "PE-WASUN'15: proceedings of the 12th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, & Ubiquitous Networks: November 2-6, 2015: Cancun, Mexico". New York: Association for Computing Machinery (ACM), 2015, p. 41-48.