| dc.description.abstract | Vehicular Ad-hoc Network (VANET) allows vehicles to send information to each other or to roadside equipment in an instant and a wireless manner. It represents a considerable step forward in terms of transportation. Indeed, many applications could benefit from instantly transmitting data such as video and music streaming. Internet connectivity could also be available to the passengers. The main objective and improvement aimed by VANET is a security matter. Warning messages for weather conditions, traffic accidents and fuel consumption instantly transmitted between vehicles would improve road safety. However, one of the critical issues in VANET is the dissemination of messages throughout the network. Indeed, routing algorithms are a key issue because of the high mobility and scalability of VANET compared to other ad-hoc networks.
This thesis contributes to the research area by firstly presenting a survey over most of the routing protocol used in VANET and classifying them according to the algorithm used. Secondly, this thesis develops more on the broadcasting algorithm category and particularly on the distance to mean heuristic method that presents good results in terms of reachability and bandwidth consumption. However, distance to mean protocol needs periodic beacons that creates a consequent overhead compared to instant rebroadcasting algorithm. Therefore, this thesis improves this method by reducing overhead using a bio inspired kinetic graph model proposed in the literature. The proposed modified algorithm has been implemented, simulated and evaluated in the network simulator NS3. Results show a lower overhead while preserving a good reachability. | en_US |
