Skip to Main content Skip to Navigation

Résolution à base d'heuristiques du problème de routage dans les réseaux ad hoc de vehicules

Abstract : Vehicular ad hoc networks (VANETs) consist of a set of vehicles trying to exchange security and comfort data even if they are not directly within radio range of each other. The problems related to VANET networks are not yet solved. In this context, and in order to maximize the stability in the VANETs networks, we propose different contributions combining the metaheuristics and the clustering technique. First, we propose a routing model using the most efficient clustering algorithm K-medoids. Then, we propose several improvements using metaheuristics, more precisely the AGs, the RT and the Scatter Search. Finally, we propose a real application that uses the Arduino Uno platform to allow communication between three mobile robots in an areas not covered by the VANET network.Using various metrics, extensive simulations prove that our contributions show good results compared to other models designed for the same purpose.
Complete list of metadatas
Contributor : Abes Star :  Contact
Submitted on : Friday, February 1, 2019 - 1:04:30 PM
Last modification on : Wednesday, September 16, 2020 - 10:42:50 AM
Long-term archiving on: : Thursday, May 2, 2019 - 1:13:20 PM


Version validated by the jury (STAR)


  • HAL Id : tel-02000974, version 1


Rejab Hajlaoui. Résolution à base d'heuristiques du problème de routage dans les réseaux ad hoc de vehicules. Réseaux et télécommunications [cs.NI]. Université Bourgogne Franche-Comté, 2018. Français. ⟨NNT : 2018UBFCD047⟩. ⟨tel-02000974⟩



Record views


Files downloads