PENERAPAN ALGORITMA SEMUT PADA PROTOKOL ROUTING AOMDV UNTUK OPTIMASI PENCARIAN RUTE DI JARINGAN VANET

Application of Ant Colony Optimization Algorithm to AOMDV Routing Protocol for Optimization of Route Search on VANET

Abstract

VANET is a derivative of the MANET network. VANET networks are more specifically used to communicate between one vehicle and another vehicle. With the existence of the VANET network it is expected to be able to improve the safety of drivers on the highway. In the application of VANET network, a routing protocol is needed. The AOMDV protocol is an example of a routing protocol that can help the performance of a VANET network. The purpose of this research is to optimize the route search in the AOMDV routing protocol. The route selection process in the AOMDV routing protocol is based on the least number of hops, so the route is likely to be disconnected quickly. To overcome the shortcomings of the AOMDV routing protocol is done by applying ant colony optimization algorithm. The advantage of ant colony optimization algorithm is that in conducting a route search performed by calculating the distance between nodes, so that the route is not quickly interrupted. Selection of the route on the ant colony optimization algorithm based on the most pheromones, pheromones are ant footprints. The author modifies some of the frameworks of the AOMDV routing protocol section named AOMDV-ant. In the study conducted 5 experiments. The trial parameters used to assess network performance are throughput, packet delivery ratio (PDR) and average end-to-end delays. From the results of trials that have been carried out on the AOMDV routing protocol using the ant colony optimization algorithm can improve the performance of the test throughput parameters of 9.7649 Kbps and the performance of the Packet delivery ratio of 11.2838%. Whereas the average end to end delay parameter can reduce the delay by 13.3093ms.